A stochastic approximation method for convex programming with many semidefinite constraints

DOI10.1080/10556788.2022.2091563OpenAlexW4285797048WikidataQ114099381 ScholiaQ114099381MaRDI QIDQ5882223

Unnamed Author, Unnamed Author, Unnamed Author

Publication date: 15 March 2023

Published in: Optimization Methods and Software (Search for Journal in Brave)

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

zbMATH Keywords

convergence analysisstochastic approximationconvex programmingerror bound conditionsemidefinite programming with many constraints

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Numerical analysis (65-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Random algorithms for convex minimization problems
• A primal-dual interior point method for nonlinear semidefinite programming
• Stochastic semidefinite programming: a new paradigm for stochastic optimization
• Semi-infinite programming
• The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
• Constructions of strict Lyapunov functions
• Error bounds and convergence analysis of feasible descent methods: A general approach
• Recent contributions to linear semi-infinite optimization
• A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods
• A feasible proximal bundle algorithm with convexification for nonsmooth, nonconvex semi-infinite programming
• How to solve a semi-infinite optimization problem
• Weak sharp minima revisited. II: Application to linear regularity and error bounds
• Sufficient optimality conditions for convex semi-infinite programming
• Linear Matrix Inequalities in System and Control Theory
• Variational Analysis
• Robust Truss Topology Design via Semidefinite Programming
• Semidefinite Programming
• Variational Analysis of Regular Mappings
• Primal-Dual Stochastic Gradient Method for Convex Programs with Many Functional Constraints
• The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implications

This page was built for publication: A stochastic approximation method for convex programming with many semidefinite constraints