Linear convergence of prox-SVRG method for separable non-smooth convex optimization problems under bounded metric subregularity
From MaRDI portal
Publication:2115253
Recommendations
- Variable metric proximal stochastic variance reduced gradient methods for nonconvex nonsmooth optimization
- scientific article; zbMATH DE number 7404502
- Asymptotic estimates for \(r\)-Whitney numbers of the second kind
- On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems
- Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems
Cites work
- scientific article; zbMATH DE number 6378119 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A coordinate gradient descent method for nonsmooth separable minimization
- A proximal stochastic gradient method with progressive variance reduction
- A unified approach to error bounds for structured convex optimization problems
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Characterization of metric regularity of subdifferentials
- Convex Analysis
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Error bounds, quadratic growth, and linear convergence of proximal methods
- Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
- Linear convergence of randomized feasible descent methods under the weak strong convexity assumption
- Lipschitz Behavior of Solutions to Convex Minimization Problems
- Metric Subregularity of Piecewise Linear Multifunctions and Applications to Piecewise Linear Multiobjective Optimization
- Metric subregularity of the convex subdifferential in Banach spaces
- Model Selection and Estimation in Regression with Grouped Variables
- Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
- New constraint qualifications for mathematical programs with equilibrium constraints via variational analysis
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- Optimization in high dimensions via accelerated, parallel, and proximal coordinate descent
- Parallel random coordinate descent method for composite minimization: convergence analysis and error bounds
- Random block coordinate descent methods for linearly constrained optimization over networks
- Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
- Regularity and conditioning of solution mappings in variational analysis
- Sparse regression using mixed norms
- Stability Theory for Systems of Inequalities. Part I: Linear Systems
- Strongly Regular Generalized Equations
- Techniques of variational analysis
- The Group Lasso for Logistic Regression
- Variational Analysis
- Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems
Cited in
(3)
This page was built for publication: Linear convergence of prox-SVRG method for separable non-smooth convex optimization problems under bounded metric subregularity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115253)
