Abstract
To resolve the time-varying convex optimization problems with the cost function, the constraints or both being time dependent, in this brief we investigate a novel type of fixed-time algorithms. First, with the unconstrained time-varying optimization problem considered, a general framework algorithm is developed for tracking its optimal trajectory within fixed time, which contains the gradient flow-based scheme and Newton-type method as its special cases. Then, considering the equality constraint being involved in the time-varying optimization problem, we design another algorithm with fixed-time convergence, which includes Newton-type scheme as its special case. To verify that the given approach achieves fixed-time convergence, the simulation result is given with first-order Euler discretization.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Circuits and Systems II: Express Briefs
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
