Linear convergence of first order methods for non-strongly convex optimization

2018/01/22 by Ion Necoara, I. Necoara, Yu. Nesterov +2 · 17 citations
Engineering · Computer Science · Mathematics · #Sparse and Compressive Sensing Techniques #Stochastic Gradient Optimization Techniques #Advanced Optimization Algorithms Research

paper · doi:10.1007/s10107-018-1232-1

Cited by

• Characterizations, Dynamical Systems and Gradient Methods for Strongly Quasiconvex Functions
• Distributed Nonlinear Equality-Constrained Optimization via Feedback Linearization and Singular Perturbation
• Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
• The Physical Systems Behind Optimization Algorithms
• Strong Global Convergence of the Consensus-Based Optimization Algorithm
• On the Tension Between Optimality and Adversarial Robustness in Policy Optimization
• Combinatorial Preconditioners for Proximal Algorithms on Graphs
• Accelerated Alternating Direction Method of Multipliers: an Optimal O(1/K) Nonergodic Analysis
• Nonasymptotic convergence of stochastic proximal point algorithms for constrained convex optimization
• Star Quasiconvexity: an Unified Approach for Linear Convergence of First-Order Methods Beyond Convexity
• A Simple Proximal Stochastic Gradient Method for Nonsmooth Nonconvex Optimization
• Optimization in Theory and Practice
• Geometric Convergence Analysis of Variational Inference via Bregman Divergences
• Semi-infinite Nonconvex Constrained Min-Max Optimization
• Linear Convergence of a Unified Primal--Dual Algorithm for Convex--Concave Saddle Point Problems with Quadratic Growth
• Proximal gradient methods in Banach spaces
• Regularized Overestimated Newton
• Time-Varying Convex Optimization via Time-Varying Averaged Operators
• The restricted strong convexity revisited: Analysis of equivalence to error bound and quadratic growth
• Extending Linear Convergence of the Proximal Point Algorithm: The Quasar-Convex Case
• Efficient Rank Minimization via Solving Non-convexPenalties by Iterative Shrinkage-Thresholding Algorithm
• On the Convergence Time of Dual Subgradient Methods for Strongly Convex Programs
• From Sublinear to Linear: Fast Convergence in Deep Networks via Locally Polyak-Lojasiewicz Regions
• Numerical Design of Optimized First-Order Algorithms
• On the Linear Convergence of the Cauchy Algorithm for a Class of Restricted Strongly Convex Functions