.png){kind=icon}
返回
Fixed-Time Algorithms for Time-Varying Convex Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TCSII.2022.3207278.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Fixed-time stability
time-varying optimization
equality constraint
nonlinear system
期刊
I
IF:
4.9
论文数:
8.8K
被引数:
2.5W
机构
引用论文
Distributed Continuous-Time Convex Optimization With Time-Varying Cost Functions具有时变成本函数的分布式连续时间凸优化
OAAI
OAAI分享收藏A fixed-time convergent algorithm for distributed convex optimization in multi-agent systems多智能体系统中分布式凸优化的固定时间收敛算法.png)
AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏Nonsingular fixed-time consensus tracking for second-order multi-agent networks二阶多智能体网络的非奇异固定时间一致性跟踪AUTOMATICA
AUTOMATICAIF5.9
PREAI
分享收藏
查看更多内容