A nonlinear Lagrange algorithm for stochastic minimax problems based on sample average approximation method (Q1714633)
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: A nonlinear Lagrange algorithm for stochastic minimax problems based on sample average approximation method |
scientific article; zbMATH DE number 7010657
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A nonlinear Lagrange algorithm for stochastic minimax problems based on sample average approximation method |
scientific article; zbMATH DE number 7010657 |
Statements
A nonlinear Lagrange algorithm for stochastic minimax problems based on sample average approximation method (English)
0 references
1 February 2019
0 references
Summary: An implementable nonlinear Lagrange algorithm for stochastic minimax problems is presented based on sample average approximation method in this paper, in which the second step minimizes a nonlinear Lagrange function with sample average approximation functions of original functions and the sample average approximation of the Lagrange multiplier is adopted. Under a set of mild assumptions, it is proven that the sequences of solution and multiplier obtained by the proposed algorithm converge to the Kuhn-Tucker pair of the original problem with probability one as the sample size increases. At last, the numerical experiments for five test examples are performed and the numerical results indicate that the algorithm is promising.
0 references
0.9260923266410828
0 references
0.808925449848175
0 references
0.8052276372909546
0 references
0.7811651229858398
0 references
0.7798903584480286
0 references