Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs

DOI10.1007/S12532-021-00214-WzbMath1489.90093arXiv2012.14943OpenAlexW3114952797MaRDI QIDQ2146450

Yonggui Yan, Yang-yang Xu

Publication date: 16 June 2022

Published in: Mathematical Programming Computation (Search for Journal in Brave)

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

zbMATH Keywords

adaptive methodssaddle-point problemstochastic gradient methodexpectation-constrained stochastic optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Stochastic programming (90C15) Numerical methods based on nonlinear programming (49M37) Methods of reduced gradient type (90C52)

Related Items (4)

APriD ⋮ Solving Stochastic Optimization with Expectation Constraints Efficiently by a Stochastic Augmented Lagrangian-Type Algorithm ⋮ Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization ⋮ Variance reduced moving balls approximation method for smooth constrained minimization problems

Uses Software

• UCI-ml
• CVX
• AdaGrad
• RMSprop
• Adam
• ADADELTA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• ADADELTA
• Stochastic compositional gradient descent: algorithms for minimizing compositions of expected-value functions
• Sample average approximation method for chance constrained programming: Theory and applications
• Uncertain convex programs: randomized solutions and confidence levels
• Algorithms for stochastic optimization with function or expectation constraints
• Iteration complexity of inexact augmented Lagrangian methods for constrained convex programming
• Stochastic First-Order Methods with Random Constraint Projection
• Graph Implementations for Nonsmooth Convex Programs
• A Neyman–Pearson Approach to Statistical Learning
• A Sample Approximation Approach for Optimization with Probabilistic Constraints
• Robust Stochastic Approximation Approach to Stochastic Programming
• A Level-Set Method for Convex Optimization with a Feasible Solution Path
• A Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems
• Primal-Dual Stochastic Gradient Method for Convex Programs with Many Functional Constraints
• Solving variational inequalities with Stochastic Mirror-Prox algorithm
• Optimal Primal-Dual Methods for a Class of Saddle Point Problems
• The Scenario Approach to Robust Control Design
• Neyman-Pearson classification, convexity and stochastic constraints
• A Stochastic Approximation Method

This page was built for publication: Adaptive primal-dual stochastic gradient method for expectation-constrained convex stochastic programs