.png){kind=icon}
.png){kind=icon}
Return
Fixed-Time Algorithms for Time-Varying Convex Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2022.3207278.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Fixed-time stability
time-varying optimization
equality constraint
nonlinear system
Journal
I
IF:
4.9
Papers:
8.8K
Citations:
2.5W