Optimal Algorithms for Stochastic Complementary Composite Minimization

DOI10.1137/22m1530884arXiv2211.01758OpenAlexW4390608808MaRDI QIDQ6136660

Unnamed Author, Alexandre d'Aspremont, Cristóbal Guzmán

Publication date: 17 January 2024

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.01758

zbMATH Keywords

regularizationaccelerated first-order methodsstochastic convex optimizationnon-Euclidean composite minimization

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30) Stochastic programming (90C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Gradient methods for minimizing composite functions
• First-order methods of smooth convex optimization with inexact oracle
• An optimal method for stochastic composite optimization
• Universal gradient methods for convex optimization problems
• On norms in some class of exponential type Orlicz spaces of random variables
• Sparsity in penalized empirical risk minimization
• Sharp uniform convexity and smoothness inequalities for trace norms
• First-order and stochastic optimization methods for machine learning
• Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Robust Stochastic Approximation Approach to Stochastic Programming
• Regularized learning schemes in feature Banach spaces
• First-Order Methods in Optimization
• High-Dimensional Statistics
• A Statistical View of Some Chemometrics Regression Tools
• Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
• An homotopy method for l _p regression provably beyond self-concordance and in input-sparsity time
• Iterative Refinement for ℓ_p-norm Regression
• Optimal Affine-Invariant Smooth Minimization Algorithms
• Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization, II: Shrinking Procedures and Optimal Algorithms
• On first-order algorithms forl₁/nuclear norm minimization
• Understanding Machine Learning
• On uniformly convex functions

This page was built for publication: Optimal Algorithms for Stochastic Complementary Composite Minimization