Convergence of first-order methods via the convex conjugate

DOI10.1016/j.orl.2017.08.013zbMath1409.90142arXiv1707.09084MaRDI QIDQ1728354

Javier F. Peña

Publication date: 22 February 2019

Published in: Operations Research Letters (Search for Journal in Brave)

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

zbMATH Keywords

acceleration; first-order methods; conjugate

Mathematics Subject Classification ID

90C25: Convex programming

90C60: Abstract computational complexity for mathematical programming problems

Related Items

Convergence Rates of Proximal Gradient Methods via the Convex Conjugate, Perturbed Fenchel duality and first-order methods

Uses Software

• TFOCS

Cites Work

• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
• Introductory lectures on convex optimization. A basic course.
• Convex analysis and nonlinear optimization. Theory and examples
• Templates for convex cone problems with applications to sparse signal recovery
• Adaptive restart for accelerated gradient schemes
• The Rate of Convergence of Nesterov's Accelerated Forward-Backward Method is Actually Faster Than $1/k^2$
• Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints
• On the Convergence of the Proximal Point Algorithm for Convex Minimization
• Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent