Skip to main content
Log in

Convergence theory for nonconvex stochastic programming with an application to mixed logit

  • Published:
Mathematical Programming Submit manuscript

Abstract

Monte Carlo methods have extensively been used and studied in the area of stochastic programming. Their convergence properties typically consider global minimizers or first-order critical points of the sample average approximation (SAA) problems and minimizers of the true problem, and show that the former converge to the latter for increasing sample size. However, the assumption of global minimization essentially restricts the scope of these results to convex problems. We review and extend these results in two directions: we allow for local SAA minimizers of possibly nonconvex problems and prove, under suitable conditions, almost sure convergence of local second-order solutions of the SAA problem to second-order critical points of the true problem. We also apply this new theory to the estimation of mixed logit models for discrete choice analysis. New useful convergence properties are derived in this context, both for the constrained and unconstrained cases, and associated estimates of the simulation bias and variance are proposed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Anderson, S.P., De Palma, A., Thisse, J.-F.: Discrete Choice Theory of Product Differentiation. MIT Press, Cambridge, Massachusetts, USA, 1992

  2. Bastin, F., Cirillo, C., Hess, S.: Evaluation of optimisation methods for estimating mixed logit models. Transportation Research Record, vol. 1921, 35–43 (2005)

    Google Scholar 

  3. Bastin, F., Cirillo, C., Toint, P.L.: An adaptive monte carlo algorithm for computing mixed logit estimators. Computational Management Science, 3 (1), 55–79 (2006)

    Article  MathSciNet  Google Scholar 

  4. Ben-Akiva, M., Lerman, S.R.: Discrete Choice Analysis: Theory and Application to Travel Demand. The MIT Press, 1985

  5. Bhat, C.R.: Quasi-random maximum simulated likelihood estimation of the mixed multinomial logit model. Transportation Research Part B, 35 (7), 677–693 (2001)

    Article  Google Scholar 

  6. Bhat, C.R.: Simulation estimation of mixed discrete choice models using randomized and scrambled Halton sequences. Transportation Research Part B, 37 (3), 837–855 (2003)

    Article  MathSciNet  Google Scholar 

  7. Bhat, C.R., Castelar, S.: A unified mixed logit framework for modelling revealed and stated preferences: formulation and application to congestion pricing analysis in the San Francisco bay area. Transportation Research Part B, 36 (3), 593–616 (2002)

    Article  Google Scholar 

  8. Bhat, C.R., Koppelman, F.S.: Activity-based modeling of travel demand. In: R.W. Hall, (ed.) Handbook of Transportation Science, Norwell, USA. Kluwer Academic Publisher, pp. 35–61, 1999

  9. Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer-Verlag, 1997

  10. Borovkov, A.: Statistique mathmatique. Mir, 1987

  11. Cirillo, C., Axhausen, K.W.: Mode choice of complex tour. In: Proceedings of the European Transport Conference (CD-ROM), Cambridge, UK, 2002

  12. Davidson, J.: Stochastic Limit Theory. Oxford University Press, Oxford, England, 1994

  13. Deák, I.: Multidimensional integration and stochastic programming. In: Y. Ermoliev, R.J.-B. Wets, (eds.), Numerical Techniques for Stochastic Optimization, Springer Verlag, pp. 187–200, 1988

  14. Fiacco. A.V.: Introduction to Sensitivity and Stability Analysis in Nonlinear Programming. Academic, New York, USA, 1983

  15. Fishman, G.S.: Monte Carlo: Concepts, Algorithms and Applications. Springer Verlag, New York, USA, 1996

  16. Garrido. R.A.: Estimation performance of low discrepancy sequences in stated preferences. Paper presented at the 10th International Conference on Travel Behaviour Research, 2003

  17. Gill, P.E., Murray, W., Saunders, M., Stewart G.W., Wright, M.H.: Properties of a representation of a basis for the null space. Mathematical Programming, 33 (2), 172–186 (1985)

    Article  MathSciNet  Google Scholar 

  18. Gould, N.I.M.: On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem. Mathematical Programming, 32 (1), 90–99 (1985)

    Article  MathSciNet  Google Scholar 

  19. Gouriéroux, C., Monfort, A.: Simulation based econometrics in models with heterogeneity. Annales d'Economie et de Statistiques, 20 (1), 69–107 (1991)

    Google Scholar 

  20. Gouriéroux, C., Monfort, A.: Simulation-based Econometric Methods. Oxford University Press, Oxford, United Kingdom, 1996

  21. Gugat, M.: A parametric view on the Mangasarian-Fromovitz constraint qualification. Mathematical Programming, 85 (3), 643–653, 1999

    Article  MathSciNet  Google Scholar 

  22. Gürkan, G., Özge, A.Y., Robinson, S.M.: Sample-path solution of stochastic variational inequalities. Mathematical Programming, 84 (2), 313–333 (1999)

    Google Scholar 

  23. Gürkan, G., Özge, A.Y., Robinson, S.M.: Solving stochastic optimization problems with stochastic constraints: an application in network design. In: D.T. Sturrock, P.A. Farrington, H.B. Nembhard, G.W. Evans, (eds.), Proceedings of the 1999 Winter Simulation Conference, USA, pp. 471–478, 1999

  24. Hajivassiliou, V.A., McFadden. D.L.: The method of simulated scores for the estimation of LDV models. Econometrica, 66 (4), 863–896 (1998)

    Article  Google Scholar 

  25. Hensher, D.A., Greene, W.H.: The mixed logit model: The state of practice. Transportation, 30 (2), 133–176 (2003)

    Article  Google Scholar 

  26. Hess, S., Polak, J., Daly, A.: On the performance of shuffled Halton sequences in the estimation of discrete choice models. In: Proceedings of European Transport Conference (CD-ROM), Strasbourg, France, 2003. PTRC

  27. Hess, S., Train, K., Polak, J.: On the use of a modified latin hypercube sampling (mlhs) approach in the estimation of a mixed logit model for vehicle choice. Transportation Research Part B, 40 (2), 147–163 (2006)

    Article  Google Scholar 

  28. Kall, P., Wallace. S.W.: Stochastic Programming. John Wiley & Sons, 1994

  29. Montmarquette, C., Cannings, K., Mahseredjian, S.: How do young people choose college majors? Economics of Education Review, 21 (6), 543–556 (2002)

  30. Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York, USA, 1999

  31. Parthasarathy, K.R.: Probability Measures on Metric Spaces. Academic Press, 1967

  32. Robinson, S.M.: Local epi-continuity and local optimization. Mathematical Programming, 37 (2), 208–222 (1987)

    Google Scholar 

  33. Robinson, S.M.: Analysis of sample-path optimization. Mathematics of Operations Research, 21 (3), 513–528 (1996)

    Article  Google Scholar 

  34. Rubinstein, R.Y., Shapiro, A.: Discrete Event Systems. John Wiley & Sons, Chichester, England, 1993

  35. Sándor, Z., Train, K.: Quasi-random simulation of discrete choice models. Transportation Research Part B, 38 (4), 313–327 (2004)

    Article  Google Scholar 

  36. Shapiro, A.: Probabilistic constrained optimization: Methodology and applications. In: S. Uryasev, (ed.), Statistical inference of stochastic optimization problems. Kluwer Academic Publishers, pp. 282–304, 2000

  37. Shapiro, A.: Stochastic programming by Monte Carlo simulation methods. SPEPS, 2000

  38. Shapiro, A.: Monte Carlo sampling methods. In: A. Shapiro, A. Ruszczyński, (eds.), Stochastic Programming, Vol. 10 of Handbooks in Operations Research and Management Science. Elsevier, pp. 353–425, 2003

  39. Sivakumar, A., Bhat, C.R., Ökten, G.: Simulation estimation of mixed discrete choice models using randomized quasi-monte carlo sequences: A comparison of alternative sequences, scrambling method, and uniform-to-normal variate transformation techniques. Transportation Research Record, vol. 1921, 112–122 (2005)

    Google Scholar 

  40. Train, K.: Halton sequences for mixed logit. Working paper No. E00-278, Department of Economics, University of California, Berkeley, 1999

  41. Train, K.: Discrete Choice Methods with Simulation. Cambridge University Press, New York, USA, 2003

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fabian Bastin.

Additional information

Research Fellow of the Belgian National Fund for Scientific Research

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bastin, F., Cirillo, C. & Toint, P. Convergence theory for nonconvex stochastic programming with an application to mixed logit. Math. Program. 108, 207–234 (2006). https://doi.org/10.1007/s10107-006-0708-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10107-006-0708-6

Keywords