Linear convergence of prox-SVRG method for separable non-smooth convex optimization problems under bounded metric subregularity
type: Item
instance of: scholarly article
title: Linear convergence of prox-SVRG method for separable non-smooth convex optimization problems under bounded metric subregularity
zbMATH Open document ID: 1487.90530
author: Jin Zhang
author: Xi-De Zhu
published in: Journal of Optimization Theory and Applications
publication date: 2022-03-15T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C52
zbMATH DE Number: 7490444
zbMATH Keywords: linear convergence
zbMATH Keywords: bounded metric subregularity
zbMATH Keywords: calmness
zbMATH Keywords: proximal stochastic variance-reduced gradient
zbMATH Keywords: randomized block-coordinate proximal gradient
describes a project that uses: Saga
MaRDI profile type: Publication
full work available at URL: s10957-021-01978-w
OpenAlex ID: W4205999994
cites work: Q3515815
cites work: Metric subregularity of the convex subdifferential in Banach spaces
cites work: Lipschitz Behavior of Solutions to Convex Minimization Problems
cites work: Techniques of variational analysis
cites work: Regularity and conditioning of solution mappings in variational analysis
cites work: Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
cites work: Optimization in high dimensions via accelerated, parallel, and proximal coordinate descent
cites work: Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints
cites work: New Constraint Qualifications for Mathematical Programs with Equilibrium Constraints via Variational Analysis
cites work: Sparse regression using mixed norms
cites work: On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
cites work: Q2953662
cites work: The Group Lasso for Logistic Regression
cites work: Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds
cites work: Random block coordinate descent methods for linearly constrained optimization over networks
cites work: Efficiency of coordinate descent methods on huge-scale optimization problems
cites work: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
cites work: Convex Analysis
cites work: Variational Analysis
cites work: Stability Theory for Systems of Inequalities. Part I: Linear Systems
cites work: Strongly Regular Generalized Equations
cites work: Q4864293
cites work: Approximation accuracy, gradient methods, and error bound for structured convex optimization
cites work: A coordinate gradient descent method for nonsmooth separable minimization
cites work: Q2934047
cites work: A Proximal Stochastic Gradient Method with Progressive Variance Reduction
cites work: Necessary Optimality Conditions for Optimization Problems with Variational Inequality Constraints
cites work: Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems
cites work: Model Selection and Estimation in Regression with Grouped Variables
cites work: Metric Subregularity of Piecewise Linear Multifunctions and Applications to Piecewise Linear Multiobjective Optimization
cites work: A unified approach to error bounds for structured convex optimization problems
DOI: 10.1007/S10957-021-01978-W
description: scientific article; zbMATH DE number 7490444