Inexact proximal stochastic gradient method for convex composite optimization
type: Item
instance of: scholarly article
title: Inexact proximal stochastic gradient method for convex composite optimization
zbMATH Open document ID: 1390.90432
author: Xiao Wang
author: Shuxiong Wang
author: Hongchao Zhang
published in: Computational Optimization and Applications
publication date: 2018-02-01T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 47N10
Mathematics Subject Classification ID: 65K10
zbMATH DE Number: 6833521
zbMATH Keywords: convex composite optimization
zbMATH Keywords: empirical risk minimization
zbMATH Keywords: stochastic gradient
zbMATH Keywords: inexact methods
zbMATH Keywords: global convergence
zbMATH Keywords: complexity bound
describes a project that uses: Saga
describes a project that uses: AdaGrad
MaRDI profile type: Publication
full work available at URL: s10589-017-9932-7
OpenAlex ID: W2745037491
cites work: Q3632456
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: Q3151174
cites work: Incremental proximal methods for large scale convex optimization
cites work: A Singular Value Thresholding Algorithm for Matrix Completion
cites work: Q5396673
cites work: Total Variation Projection With First Order Schemes
cites work: Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
cites work: Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization, II: Shrinking Procedures and Optimal Algorithms
cites work: MAGMA: Multilevel Accelerated Gradient Mirror Descent Algorithm for Large-Scale Convex Composite Minimization
cites work: An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP
cites work: Q5396679
cites work: An optimal method for stochastic composite optimization
cites work: Fixed point and Bregman iterative methods for matrix rank minimization
cites work: CUR matrix decompositions for improved data analysis
cites work: Q5396698
cites work: Gradient methods for minimizing composite functions
cites work: Q4903682
cites work: Practical inexact proximal quasi-Newton method with global complexity analysis
cites work: Minimizing finite sums with the stochastic average gradient
cites work: Stochastic Dual Coordinate Ascent Methods for Regularized Loss Minimization
cites work: Accelerated and inexact forward-backward algorithms
cites work: Incremental constraint projection methods for variational inequalities
cites work: Stochastic first-order methods with random constraint projection
cites work: A Proximal Stochastic Gradient Method with Progressive Variance Reduction
cites work: Model Selection and Estimation in Regression with Grouped Variables
cites work: Q3149262
cites work: Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization
DOI: 10.1007/S10589-017-9932-7
Recommended article: Inexact proximal stochastic second-order methods for nonconvex composite optimization
Recommended article: Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems
Recommended article: Stochastic proximal splitting algorithm for composite minimization
Recommended article: Stochastic proximal quasi-Newton methods for non-convex composite optimization
Recommended article: Stochastic variance-reduced prox-linear algorithms for nonconvex composite optimization
Recommended article: Incremental proximal gradient scheme with penalization for constrained composite convex optimization problems
Recommended article: Nonconvex optimization with inertial proximal stochastic variance reduction gradient
Recommended article: Gradient-free proximal methods with inexact oracle for convex stochastic nonsmooth optimization problems on the simplex
Recommended article: Q4969178
Recommended article: Q5057944
description: scientific article; zbMATH DE number 6833521