From error bounds to the complexity of first-order descent methods for convex functions

2016/11/30 by Jérôme Bolte, Trong Phong Nguyen, Juan Peypouquet +1 · 11 citations
Engineering · Mathematics · Computer Science · #Sparse and Compressive Sensing Techniques #Advanced Optimization Algorithms Research #Optimization and Variational Analysis

paper · doi:10.1007/s10107-016-1091-6

Citations

• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methods
• Proximal alternating linearized minimization for nonconvex and nonsmooth problems

Cited by

• Memory-Computation Tradeoffs in Semi Amortized Parametric Optimization
• A smoothing moving balls approximation method for a class of conic-constrained difference-of-convex optimization problems
• Constrained Path Reasoning: Measuring When Committed Stages Earn Their Cost
• Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
• A Proximal Method for Composite Optimization with Smooth and Convex Components
• Continuized Nesterov Acceleration for Non-Convex Optimization
• Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
• SMART: The Stochastic Monotone Aggregated Root-Finding Algorithm
• First-order majorization-minimization meets high-order majorant: Boosted inexact high-order forward-backward method
• Error bounds for perspective cones of a class of nonnegative Legendre functions
• The restricted strong convexity revisited: Analysis of equivalence to error bound and quadratic growth
• Diffusion Generative Models Meet Compressed Sensing, with Applications to Imaging and Finance
• LeAP-SSN: A Semismooth Newton Method with Global Convergence Rates