Stochastic First-Order Methods with Random Constraint Projection

DOI10.1137/130931278zbMath1333.90098OpenAlexW2295489065MaRDI QIDQ2796796

Dimitri P. Bertsekas, Mengdi Wang

Publication date: 30 March 2016

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

Full work available at URL: http://hdl.handle.net/1721.1/103776

zbMATH Keywords

large-scale optimizationstochastic approximationprojectionrandomized algorithmsubgradientfeasibilityonline optimizationproximal

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (27)

Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems ⋮ Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs ⋮ Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee ⋮ A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems ⋮ Inexact proximal stochastic gradient method for convex composite optimization ⋮ A stochastic gradient descent algorithm to maximize power utility of large credit portfolios under Marshall-Olkin dependence ⋮ Achieving Geometric Convergence for Distributed Optimization Over Time-Varying Graphs ⋮ Primal-Dual Stochastic Gradient Method for Convex Programs with Many Functional Constraints ⋮ Penalty methods with stochastic approximation for stochastic nonlinear programming ⋮ Almost sure convergence of random projected proximal and subgradient algorithms for distributed nonsmooth convex optimization ⋮ Two stochastic optimization algorithms for convex optimization with fixed point constraints ⋮ Linear convergence of the randomized sparse Kaczmarz method ⋮ Multilevel Stochastic Gradient Methods for Nested Composition Optimization ⋮ String-averaging incremental stochastic subgradient algorithms ⋮ A Smooth Inexact Penalty Reformulation of Convex Problems with Linear Constraints ⋮ Near-optimal stochastic approximation for online principal component estimation ⋮ New nonasymptotic convergence rates of stochastic proximal point algorithm for stochastic convex optimization ⋮ Forward-Backward-Half Forward Algorithm for Solving Monotone Inclusions ⋮ A stochastic moving ball approximation method for smooth convex constrained minimization ⋮ Notes on random optimal control equilibrium problem via stochastic inverse variational inequalities ⋮ Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning ⋮ On the analysis of variance-reduced and randomized projection variants of single projection schemes for monotone stochastic variational inequality problems ⋮ Stochastic proximal splitting algorithm for composite minimization ⋮ Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities ⋮ Accelerating Stochastic Composition Optimization ⋮ Quasi-convex feasibility problems: subgradient methods and convergence rates ⋮ Stochastic heavy-ball method for constrained stochastic optimization problems

Cites Work

• Random algorithms for convex minimization problems
• Incremental proximal methods for large scale convex optimization
• The rate of convergence for the cyclic projections algorithm. I: Angles between convex sets
• The rate of convergence for the cyclic projections algorithm. II: Norms of nonlinear operators
• The rate of convergence for the cyclic projections algorithm. III: Regularity of convex sets
• Incremental constraint projection methods for variational inequalities
• Incremental Subgradient Methods for Nondifferentiable Optimization
• Randomized Methods for Linear Constraints: Convergence Rates and Conditioning
• Relaxed Alternating Projection Methods
• On Projection Algorithms for Solving Convex Feasibility Problems
• Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization
• Alternating Projections on Manifolds
• The method of projections for finding the common point of convex sets
• Functional Operators (AM-21), Volume 1
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Stochastic First-Order Methods with Random Constraint Projection