Skip to main content
Log in

Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints

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

Abstract

Mathematical programs with equilibrium (or complementarity) constraints, MPECs for short, form a difficult class of optimization problems. The feasible set of MPECs is described by standard equality and inequality constraints as well as additional complementarity constraints that are used to model equilibrium conditions in different applications. But these complementarity constraints imply that MPECs violate most of the standard constraint qualifications. Therefore, more specialized algorithms are typically applied to MPECs that take into account the particular structure of the complementarity constraints. One popular class of these specialized algorithms are the relaxation (or regularization) methods. They replace the MPEC by a sequence of nonlinear programs NLP(t) depending on a parameter t, then compute a KKT-point of each NLP(t), and try to get a suitable stationary point of the original MPEC in the limit t→0. For most relaxation methods, one can show that a C-stationary point is obtained in this way, a few others even get M-stationary points, which is a stronger property. So far, however, these results have been obtained under the assumption that one is able to compute exact KKT-points of each NLP(t). But this assumption is not implementable, hence a natural question is: What kind of stationarity do we get if we only compute approximate KKT-points? It turns out that most relaxation methods only get a weakly stationary point under this assumption, while in this paper, we show that the smooth relaxation method by Lin and Fukushima (Ann. Oper. Res. 133:63–84, 2005) still yields a C-stationary point, i.e. the inexact version of this relaxation scheme has the same convergence properties as the exact counterpart.

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.

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Anitescu, M.: On using the elastic mode in nonlinear programming approaches to mathematical programs with complementarity constraints. SIAM J. Optim. 15, 1203–1236 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Anitescu, M.: Global convergence of an elastic mode approach for a class of mathematical programs with complementarity constraints. SIAM J. Optim. 16, 120–145 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bazaraa, M.S., Shetty, C.M.: Foundations of Optimization. Lecture Notes in Economics and Mathematical Systems. Springer, Berlin (1976)

    Book  MATH  Google Scholar 

  4. Demiguel, A.V., Friedlander, M.P., Nogales, F.J., Scholtes, S.: A two-sided relaxation scheme for mathematical programs with equilibrium constraints. SIAM J. Optim. 16, 587–609 (2005)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  6. 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 

  7. Flegel, M.L., Kanzow, C.: Abadie-type constraint qualification for mathematical programs with equilibrium constraints. J. Optim. Theory Appl. 124, 595–614 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  8. Fletcher, R., Leyffer, S.: Solving mathematical programs with complementarity constraints as nonlinear programs. Optim. Methods Softw. 19, 15–40 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  9. Hoheisel, T., Kanzow, C., Schwartz, A.: Improved convergence properties of the Lin-Fukushima-regularization method for mathematical programs with complementarity constraints. Numer. Algebra Control Optim. 1, 49–60 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  10. Hoheisel, T., Kanzow, C., Schwartz, A.: Theoretical and numerical comparison of relaxation methods for mathematical programs with complementarity constraints. Math. Program. 137, 257–288 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  11. Hu, X.M., Ralph, D.: Convergence of a penalty method for mathematical programs with equilibrium constraints. J. Optim. Theory Appl. 123, 365–390 (2004)

    Article  MathSciNet  Google Scholar 

  12. Izmailov, A.F., Pogosyan, A.L., Solodov, M.V.: Semismooth Newton method for the lifted reformulation of mathematical programs with complementarity constraints. Comput. Optim. Appl. 51, 199–221 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  13. Kadrani, A., Dussault, J.-P., Benchakroun, A.: A new regularization scheme for mathematical programs with complementarity constraints. SIAM J. Optim. 20, 78–103 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  14. Kanzow, C., Schwartz, A.: A new regularization method for mathematical programs with complementarity constraints with strong convergence properties. SIAM J. Optim. (to appear)

  15. Kanzow, C., Schwartz, A.: The price of inexactness: convergence properties of relaxation methods for mathematical programs with complementarity constraints revisited. Preprint, Institute of Mathematics, University of Würzburg, Würzburg, Germany, March 2013

  16. Leyffer, S., López-Calva, G., Nocedal, J.: Interior methods for mathematical programs with complementarity constraints. SIAM J. Optim. 17, 52–77 (2007)

    Article  Google Scholar 

  17. Lin, G.H., Fukushima, M.: A modified relaxation scheme for mathematical programs with complementarity constraints. Ann. Oper. Res. 133, 63–84 (2005)

    Article  MATH  MathSciNet  Google Scholar 

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

    Book  Google Scholar 

  19. Mangasarian, O.L.: Nonlinear Programming. McGraw-Hill, New York (1969). Reprinted by SIAM, Philadelphia (1994)

    MATH  Google Scholar 

  20. Nocedal, J., Wright, S.J.: Numerical Optimization, 2nd edn. Springer, Berlin (2006)

    MATH  Google Scholar 

  21. Outrata, J.V.: Optimality conditions for a class of mathematical programs with equilibrium constraints. Math. Oper. Res. 24, 627–644 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  22. Outrata, J.V.: A generalized mathematical program with equilibrium constraints. SIAM J. Control Optim. 38, 1623–1638 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  23. Outrata, J.V., Kočvara, M., Zowe, J.: Nonsmooth Approach to Optimization Problems with Equilibrium Constraints. Nonconvex Optimization and Its Applications. Kluwer Academic, Dordrecht (1998)

    Book  Google Scholar 

  24. Pang, J.-S., Fukushima, M.: Complementarity constraint qualifications and simplified B-stationarity conditions for mathematical programs with equilibrium constraints. Comput. Optim. Appl. 13, 111–136 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  25. Raghunathan, A.U., Biegler, L.T.: An interior point method for mathematical programs with complementarity constraints (MPCCs). SIAM J. Optim. 15, 720–750 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  26. Ralph, D., Wright, S.J.: Some properties of regularization and penalization schemes for MPECs. Optim. Methods Softw. 19, 527–556 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  27. Scheel, H., Scholtes, S.: Mathematical programs with complementarity constraints: stationarity, optimality, and sensitivity. Math. Oper. Res. 25, 1–22 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  28. Scholtes, S.: Convergence properties of a regularization scheme for mathematical programs with complementarity constraints. SIAM J. Optim. 11, 918–936 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  29. Steffensen, S., Ulbrich, M.: A new regularization scheme for mathematical programs with equilibrium constraints. SIAM J. Optim. 20, 2504–2539 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  30. Stein, O.: Lifting mathematical programs with complementarity constraints. Math. Program. 131, 71–94 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  31. Ye, J.J.: Constraint qualifications and necessary optimality conditions for optimization problems with variational inequality constraints. SIAM J. Optim. 10, 943–962 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  32. Ye, J.J.: Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints. J. Math. Anal. Appl. 307, 350–369 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  33. Ye, J.J., Ye, X.Y.: Necessary optimality conditions for optimization problems with variational inequality constraints. Math. Oper. Res. 22, 977–997 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  34. Ye, J.J., Zhu, D.L.: Optimality conditions for bilevel programming problems. Optimization 33, 9–27 (1995)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Christian Kanzow.

Additional information

Dedicated to Masao Fukushima, in great respect, on the occasion of his 65th birthday.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kanzow, C., Schwartz, A. Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints. Comput Optim Appl 59, 249–262 (2014). https://doi.org/10.1007/s10589-013-9575-2

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10589-013-9575-2

Keywords

Navigation