Skip to main content
Log in

An inexact-restoration method for nonlinear bilevel programming problems

  • Published:
Computational Optimization and Applications Aims and scope Submit manuscript

Abstract

We present a new algorithm for solving bilevel programming problems without reformulating them as single-level nonlinear programming problems. This strategy allows one to take profit of the structure of the lower level optimization problems without using non-differentiable methods. The algorithm is based on the inexact-restoration technique. Under some assumptions on the problem we prove global convergence to feasible points that satisfy the approximate gradient projection (AGP) optimality condition. Computational experiments are presented that encourage the use of this method for general bilevel problems.

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

Access this article

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. Andreani, R., Martínez, J.M.: On the solution of mathematical programming problems with equilibrium constraints. Math. Method. Oper. Res. 54, 345–358 (2001)

    Article  MATH  Google Scholar 

  2. Bard, J.F.: Practical Bilevel Optimization: Algorithms and Applications. Kluwer Academic, Dordrecht (1998)

    MATH  Google Scholar 

  3. Birgin, E.J., Martínez, J.M.: Large-scale active-set box-constrained optimization method with spectral projected gradients. Comput. Optim. Appl. 23, 101–125 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bracken, J., McGill, J.: Mathematical programs with optimization problems in the constraints. Oper. Res. 21, 37–44 (1973)

    Article  MATH  MathSciNet  Google Scholar 

  5. Candler, W., Norton, R.: Multilevel programming. Technical Report 20, World Bank Development Research Center, Washington DC, USA

  6. Castro, S.L.C., Fancello, E.A., Friedlander, A., Santos, S.A.: Computational experiments in truss topology design with an inexact restoration method. Technical Report (2006), available at http://www.ime.unicamp.br/~friedlan

  7. Colson, B.: BIPA (Bilevel programming with approximation methods): Software guide and test problems. Technical Report CRT-2002-38, Centre de Recherche sur les Transports, Université de Montréal, Montréal, QC, Canada (2002)

  8. Colson, B., Marcotte, P., Savard, G.: A trust-region method for nonlinear bilevel programming: Algorithm and computational experience. Comput. Optim. Appl. 30(3), 211–227 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  9. Colson, B., Marcotte, P., Savard, G.: Bilevel programming: A survey. 4OR: Q. J. Oper. Res. 3, 87–107 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  10. Dai, Y.: Convergence properties of the BFGS Algorithm. SIAM J. Optim. 13(3), 693–701 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  11. Dempe, S.: Foundations of Bilevel Programming. Nonconvex Optimization and its Applications Series, vol. 61. Kluwer Academic, Dordrecht (2002)

    MATH  Google Scholar 

  12. Dempe, S.: Annottated bibliography on bilevel programming and mathematical problems with equilibrium constraints. Optimization 52, 333–359 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Dempe, S.: Bilevel programming—A survey. Technical Report TU 2003-11, Bergakademie Freiberg (2003)

  14. Facchinei, F., Fischer, A., Kanzow, C.: On the accurate identification of active constraints. SIAM J. Optim. 9(1), 14–32 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  15. Facchinei, F., Jiang, H., Qi, L.: A smoothing method for mathematical programs with equilibrium constraints. Math. Program. 85, 107–134 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  16. Fischer, A.: Modified Wilson method for nonlinear programs with nonunique multipliers. Math. Oper. Res. 24, 699–727 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  17. Fletcher, R., Leyffer, S., Ralph, D., Scholtes, S.: Local convergence of SQP methods for mathematical programs with equilibrium constraints. SIAM J. Optim. 17(1), 259–286 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  18. Floudas, C.A., et al.: Handbook of Test Problems in Local and Global Optimization. Kluwer Academic, Dordrecht (1999)

    MATH  Google Scholar 

  19. Hager, W.W., Gowda, M.S.: Stability in the presence of degeneracy and error estimation. Math. Program. 85, 181–192 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  20. Luo, Z.Q., Pang, J.S., Ralph, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge (1996)

    Google Scholar 

  21. Martínez, J.M.: Two-phase model algorithm with global convergence for nonlinear programming. J. Optim. Theory Appl. 96(2), 397–436 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  22. Martínez, J.M.: Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming. J. Optim. Theory Appl. 111(1), 39–58 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  23. Martínez, J.M., Pilotta, E.A.: Inexact-restoration algorithm for constrained optimization. J. Optim. Theory Appl. 104, 135–163 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  24. Martínez, J.M., Pilotta, E.A.: Inexact restoration methods for nonlinear programming: Advances and perspectives. In: Qi, L.Q., Teo, K.L., Yang, X.Q. (eds.) Optimization and Control with Applications, pp. 271–292. Springer, New York (2005)

    Chapter  Google Scholar 

  25. Martínez, J.M., Svaiter, B.F.: A practical optimality condition without constraint qualifications for nonlinear programming. J. Optim. Theory Appl. 118, 117–133 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  26. Mascarenhas, W.F.: The BFGS method with exact line searches fails for non-convex objective functions. Math. Program. Ser. B 99, 49–61 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  27. Murtagh, B.A., Saunders, M.A.: MINOS 5.4 User’s Guide. Technical Report SOL 83-20, Stanford University (1995)

  28. Rockafellar, R.T., Wets, R.J.B.: Variational Analysis. Springer, Berlin (1998)

    MATH  Google Scholar 

  29. Shimizu, K., Ishizuka, Y., Bard, J.F.: Nondifferentiable and Two-Level Mathematical Programming. Kluwer Academic, Dordrecht (1997)

    MATH  Google Scholar 

  30. Solodov, M.V., Svaiter, B.F.: A new projection method for variational inequality problems. SIAM J. Control Optim. 37(3), 756–776 (1999)

    Article  MathSciNet  Google Scholar 

  31. Vicente, L.N., Calamai, P.H.: Bilevel and multilevel programming: A bibliography review. J. Global Optim. 5, 1–23 (1994)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. Friedlander.

Additional information

This work was supported by PRONEX-Optimization (PRONEX—CNPq/FAPERJ E-26/171.164/2003—APQ1), FAPESP (Grants 06/53768-0 and 05-56773-1) and CNPq.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Andreani, R., Castro, S.L.C., Chela, J.L. et al. An inexact-restoration method for nonlinear bilevel programming problems. Comput Optim Appl 43, 307–328 (2009). https://doi.org/10.1007/s10589-007-9147-4

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-007-9147-4

Keywords

Navigation