Stochastic methods based on \(\mathcal{VU}\)-decomposition methods for stochastic convex minimax problems
From MaRDI portal
Publication:1719328
DOI10.1155/2014/894248zbMath1407.90244OpenAlexW2054834785WikidataQ59070444 ScholiaQ59070444MaRDI QIDQ1719328
Publication date: 8 February 2019
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/894248
Minimax problems in mathematical programming (90C47) Nonsmooth analysis (49J52) Stochastic programming (90C15)
Cites Work
- A decomposition algorithm for convex nondifferentiable minimization with errors
- A superlinear space decomposition algorithm for constrained nonsmooth convex program
- Sample average approximation method for chance constrained programming: Theory and applications
- Stochastic methods based on Newton method to the stochastic variational inequality problem with constraint conditions
- On $\mathcalVU$-theory for Functions with Primal-Dual Gradient Structure
- Penalized Sample Average Approximation Methods for Stochastic Mathematical Programs with Complementarity Constraints
- SAMPLE AVERAGE APPROXIMATION METHODS FOR A CLASS OF STOCHASTIC VARIATIONAL INEQUALITY PROBLEMS
- Lectures on Stochastic Programming
- Primal-Dual Gradient Structured Functions: Second-Order Results; Links to Epi-Derivatives and Partly Smooth Functions
- The 𝒰-Lagrangian of a convex function
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Stochastic methods based on \(\mathcal{VU}\)-decomposition methods for stochastic convex minimax problems
