Optimal complexity and certification of Bregman first-order methods

DOI10.1007/s10107-021-01618-1zbMath1494.90076arXiv1911.08510MaRDI QIDQ2149545

Alexandre d'Aspremont, Jérôme Bolte, Adrien B. Taylor, Radu-Alexandru Dragomir

Publication date: 29 June 2022

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.08510

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

90C22: Semidefinite programming

90C25: Convex programming

90C06: Large-scale problems in mathematical programming

90C60: Abstract computational complexity for mathematical programming problems

Uses Software

• YALMIP
• Mosek
• PESTO