Penalty-based SAA method of stochastic nonlinear complementarity problems
Mingzheng Wang, M. Montaz Ali
Abstract
Mingzheng Wang, M. Montaz Ali
Abstract
We consider a class of stochastic nonlinear complementarityproblems. We first formulate the stochastic complementarity problemas a stochastic programming model. Based on this reformulation, wepropose a penalty-based sample average approximation (in short, SAA) method forstochastic complementarity problem and prove its convergence.Finally, we report some numerical test results to show theefficiency of our method.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We consider a class of stochastic nonlinear complementarityproblems. We first formulate the stochastic complementarity problemas a stochastic programming model. Based on this reformulation, wepropose a penalty-based sample average approximation (in short, SAA) method forstochastic complementarity problem and prove its convergence.Finally, we report some numerical test results to show theefficiency of our method.
Key concepts: Mixed complementarity problem, Complementarity (molecular biology), Nonlinear complementarity problem, Mathematical optimization, Complementarity theory, Nonlinear system, Convergence (economics), Computer science