Rate of convergence analysis of a dual fast gradient method for general convex optimization

被引：0

作者：

Patrascu, Andrei ^{[1
]}

Necoara, Ion ^{[1
]}

Findeisen, Rolf ^{[2
]}

机构：

[1] Univ Politehn Bucuresti, Automat Control & Syst Engn Dept, Bucharest, Romania

[2] Univ Magdeburg, Inst Automat Engn, D-39106 Magdeburg, Germany

来源：

2015 54TH IEEE CONFERENCE ON DECISION AND CONTROL (CDC) | 2015年

关键词：

COMPUTATIONAL-COMPLEXITY; ALGORITHM;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper we analyze the iteration complexity of a dual fast gradient method for solving general constrained convex problems, that can arise e.g in embedded model predictive control (MPC). When it is difficult to project on the primal feasible set described by convex constraints, we use the Lagrangian relaxation to handle the complicated constraints and then, we apply a dual fast gradient algorithm for solving the corresponding dual problem. We provide sublinear estimates on the primal suboptimality and feasibility violation of the generated approximate primal solutions. The iteration complexity analysis is based on two types of approximate primal solutions: the last primal iterate sequence and an average primal sequence. We also test the performance of the algorithm on MPC for a simplified model of a self balancing robot.

引用

页码：3311 / 3316

页数：6

共 50 条

[21] Accelerated Gradient Methods for Geodesically Convex Optimization: Tractable Algorithms and Convergence Analysis
Kim, Jungbin
Yang, Insoon
[J]. INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 162, 2022,
[22] Fractional differential equation approach for convex optimization with convergence rate analysis
Liang, Shu
Wang, Leyi
Yin, George
[J]. OPTIMIZATION LETTERS, 2020, 14 (01) : 145 - 155
[23] Fractional differential equation approach for convex optimization with convergence rate analysis
Shu Liang
Leyi Wang
George Yin
[J]. Optimization Letters, 2020, 14 : 145 - 155
[24] CONVERGENCE RATE OF GRADIENT DESCENT METHOD FOR MULTI-OBJECTIVE OPTIMIZATION
Zeng, Liaoyuan
Dai, Yuhong
Huang, Yakui
[J]. JOURNAL OF COMPUTATIONAL MATHEMATICS, 2019, 37 (05) : 689 - 703
[25] Convergence and rate of convergence of some greedy algorithms in convex optimization
V. N. Temlyakov
[J]. Proceedings of the Steklov Institute of Mathematics, 2016, 293 : 325 - 337
[26] Convergence and rate of convergence of some greedy algorithms in convex optimization
Temlyakov, V. N.
[J]. PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2016, 293 (01) : 325 - 337
[27] On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces
Bello Cruz, J. Y.
De Oliveira, W.
[J]. NUMERICAL FUNCTIONAL ANALYSIS AND OPTIMIZATION, 2016, 37 (02) : 129 - 144
[28] A DUAL BREGMAN PROXIMAL GRADIENT METHOD FOR RELATIVELY-STRONGLY CONVEX OPTIMIZATION
Liu, Jin-Zan
Liu, Xin-Wei
[J]. NUMERICAL ALGEBRA CONTROL AND OPTIMIZATION, 2022, 12 (04): : 679 - 692
[29] Primal-dual incremental gradient method for nonsmooth and convex optimization problems
Jalilzadeh, Afrooz
[J]. OPTIMIZATION LETTERS, 2021, 15 (08) : 2541 - 2554
[30] Primal-dual incremental gradient method for nonsmooth and convex optimization problems
Afrooz Jalilzadeh
[J]. Optimization Letters, 2021, 15 : 2541 - 2554

← 1 2 3 4 5 →