Mini-batch stochastic subgradient for functional constrained optimization

DOI10.1080/02331934.2023.2189015MaRDI QIDQ6565290zbMATH OpenFDO

Authors Nitesh Kumar Singh, Ion Necoara, Vyacheslav Kungurtsev

Publication date 1 July 2024

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2023.2189015

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Stochastic programming (90C15) Convex programming (90C25)

Recommendations

• Random minibatch subgradient algorithms for convex problems with functional constraints
• Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities
• Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
• Primal-Dual Stochastic Gradient Method for Convex Programs with Many Functional Constraints
• Stochastic first-order methods for convex and nonconvex functional constrained optimization

Cites work

• A Stochastic Approximation Method
• Acceleration of Stochastic Approximation by Averaging
• Algorithms for Fitting the Constrained Lasso
• Computational complexity of inexact gradient augmented Lagrangian methods: application to constrained MPC
• Convergence of stochastic proximal gradient algorithm
• Efficient online and batch learning using forward backward splitting
• General convergence analysis of stochastic first-order methods for composite optimization
• scientific article; zbMATH DE number 3790208 (Why is no real title available?)
• scientific article; zbMATH DE number 1328979 (Why is no real title available?)
• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• scientific article; zbMATH DE number 7064055 (Why is no real title available?)
• Lectures on convex optimization
• Linear convergence of first order methods for non-strongly convex optimization
• Minimization of unsmooth functionals
• Nonasymptotic convergence of stochastic proximal point methods for constrained convex optimization
• On optimal probabilities in stochastic coordinate descent methods
• Random minibatch subgradient algorithms for convex problems with functional constraints
• Robust Stochastic Approximation Approach to Stochastic Programming
• RSG: Beating Subgradient Method without Smoothness and Strong Convexity
• The dual and degrees of freedom of linearly constrained generalized Lasso
• The solution path of the generalized lasso

Cited in

(2)

• A stochastic moving ball approximation method for smooth convex constrained minimization
• Strongly quasiconvex functions: what we know (so far)

This page was built for publication: Mini-batch stochastic subgradient for functional constrained optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565290)