Fixed-Time Algorithms for Time-Varying Convex Optimization
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...
Saved in:
Published in | IEEE transactions on circuits and systems. II, Express briefs Vol. 70; no. 2; pp. 616 - 620 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
New York
IEEE
01.02.2023
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
ISSN: | 1549-7747 1558-3791 |
DOI: | 10.1109/TCSII.2022.3207278 |