A smoothing SAA method for a stochastic mathematical program with complementarity constraints
- 18 October 2012
- journal article
- Published by Institute of Mathematics, Czech Academy of Sciences in Applications of Mathematics
- Vol. 57 (5) , 477-502
Abstract
A smoothing sample average approximation (SAA) method based on the log-exponential function is proposed for solving a stochastic mathematical program with complementarity constraints (SMPCC) considered by Birbil et al. (S. I. Birbil, G. Gürkan, O. Listes: Solving stochastic mathematical programs with complementarity constraints using simulation, Math. Oper. Res. 31 (2006), 739–760). It is demonstrated that, under suitable conditions, the optimal solution of the smoothed SAA problem converges almost surely to that of the true problem as the sample size tends to infinity. Moreover, under a strong second-order sufficient condition for SMPCC, the almost sure convergence of Karash-Kuhn-Tucker points of the smoothed SAA problem is established by Robinson’s stability theory. Some preliminary numerical results are reported to show the efficiency of our method.Keywords
This publication has 25 references indexed in Scilit:
- Mathematical Programs with Equilibrium Constraints: Theory and Numerical Methods2007
- Solving stochastic mathematical programs with equilibrium constraints via approximation and smoothing implicit programming with penalizationMathematical Programming, 2007
- Solving Stochastic Mathematical Programs with Complementarity Constraints Using SimulationMathematics of Operations Research, 2006
- The empirical behavior of sampling methods for stochastic programmingAnnals of Operations Research, 2006
- An entropic regularization approach for mathematical programs with equilibrium constraintsComputers & Operations Research, 2004
- Stochastic mathematical programs with equilibrium constraintsOperations Research Letters, 1999
- Complementarity Constraint Qualifications and Simplified B-Stationarity Conditions for Mathematical Programs with Equilibrium ConstraintsComputational Optimization and Applications, 1999
- Sensitivity analysis for nonsmooth generalized equationsMathematical Programming, 1992
- A special newton-type optimization methodOptimization, 1992
- AN ENTROPY-BASED AGGREGATE METHOD FOR MINIMAX OPTIMIZATIONEngineering Optimization, 1992