Penalty variable sample size method for solving optimization problems with equality constraints in a form of mathematical expectation
- 8 Downloads
Equality-constrained optimization problems with deterministic objective function and constraints in the form of mathematical expectation are considered. The constraints are approximated by employing the sample average where the sample size varies throughout the iterations in an adaptive manner. The proposed method incorporates variable sample size scheme with cumulative and unbounded sample into the well- known quadratic penalty iterative procedure. Line search is used for globalization and the sample size is updated in a such way to preserve the balance between two types of errors—errors coming from the sample average approximation and the approximation of the optimal point. Moreover, the penalty parameter is also updated in an adaptive way. We prove that the proposed algorithm pushes the sample size and the penalty parameter to infinity which further allows us to prove the almost sure convergence towards a Karush-Kuhn-Tucker optimal point of the original problem under the rather standard assumptions. Numerical comparison on a set of relevant problems shows the advantage of the proposed adaptive scheme over the heuristic (predetermined) sample scheduling in terms of number of function evaluations as a measure of the optimization cost.
KeywordsStochastic optimization Equality constraints Sample average approximation Variable sample size Quadratic penalty method Line search
Unable to display preview. Download preview PDF.
We are grateful to the anonymous referee whose comments and suggestions helped us to improve the quality of this paper.
Nataša Krklec Jerinkić is supported by the Serbian Ministry of Education, Science and Technological Development, grant no. 174030.
- 1.Bastin, F.: Trust-region algorithms for nonlinear stochastic programming and mixed logit models, PhD thesis, University of Namur, Belgium (2004)Google Scholar
- 4.Birge, J.R., Louveaux, F.: Introduction to stochastic programming. Springer Series in Operations Research and Financial Engineering. Springer Science+Business Media, LLC, New York (2011)Google Scholar
- 16.Nocedal, J., Wright, S.J.: Numerical Optimization, Springer Series in Operations Research. Springer, New York (2006)Google Scholar
- 17.Pasupathy, R.: On choosing parameters in retrospective-approximation algorithms for stochastic root finding and simulation optimization. Oper. Res. 58(4), 889–901Google Scholar
- 21.Shapiro, A.: Monte Carlo sampling methods. In: Stochastic Programming, Handbook in Operations Research and Management Science 10, pp 353–425. Elsevier (2003)Google Scholar
- 22.Shapiro, A., Dentcheva, D., Ruszczynski, A.: Lectures on stochastic programming: modeling and theory. MPS-SIAM Series on Optimization (2009)Google Scholar