Smoothing techniques and augmented Lagrangian method for recourse problem of two-stage stochastic linear programming (Q364501)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Smoothing techniques and augmented Lagrangian method for recourse problem of two-stage stochastic linear programming |
scientific article; zbMATH DE number 6206851
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Smoothing techniques and augmented Lagrangian method for recourse problem of two-stage stochastic linear programming |
scientific article; zbMATH DE number 6206851 |
Statements
Smoothing techniques and augmented Lagrangian method for recourse problem of two-stage stochastic linear programming (English)
0 references
9 September 2013
0 references
Summary: The augmented Lagrangian method can be used for solving recourse problems and obtaining their normal solution in solving two-stage stochastic linear programming problems. The augmented Lagrangian objective function of a stochastic linear problem is not twice differentiable which precludes the use of a Newton method. In this paper, we apply the smoothing techniques and a fast Newton-Armijo algorithm for solving an unconstrained smooth reformulation of this problem. Computational results and comparisons are given to show the effectiveness and speed of the algorithm.
0 references
0 references
0.7957119345664978
0 references
0.78069669008255
0 references
0.7784519791603088
0 references
0.7666902542114258
0 references