Smoothing techniques and augmented Lagrangian method for recourse problem of two-stage stochastic linear programming
From MaRDI portal
Publication:364501
DOI10.1155/2013/735916zbMath1271.90047OpenAlexW2064310469WikidataQ59004152 ScholiaQ59004152MaRDI QIDQ364501
Saeed Ketabchi, Malihe Behboodi-Kahoo
Publication date: 9 September 2013
Published in: Journal of Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2013/735916
Related Items
Parallel implementation of augmented Lagrangian method within L-shaped method for stochastic linear programs ⋮ Smooth augmented Lagrangian method for twin bounded support vector machine
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Newton method for linear programming
- On the minimum norm solution of linear programs
- Newton-type methods for stochastic programming.
- A class of smoothing functions for nonlinear and mixed complementarity problems
- Newton's method for quadratic stochastic programs with recourse
- A parallel inexact Newton method for stochastic programs with recourse
- Smoothing methods for convex inequalities and linear complementarity problems
- Linear Programming under Uncertainty
- Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse
- On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Random test problems and parallel methods for quadratic programs and quadratic stochastic programs∗
- Convex Analysis
- Augmented Lagrangian method for large-scale linear programming problems
- Recent Advances in Constraints
- SSVM: A smooth support vector machine for classification
