Optimization problems with equilibrium constraints and their numerical solution

Mathematical Programming

Volumn 101, Issue 1, 2004, Pages 119-149

  Kočvara, Michal ^a   Outrata, Jiří V ^b  

^a UNIVERSITY OF ERLANGEN NUREMBERG   (Germany)

^b INSTITUTE OF INFORMATION THEORY AND AUTOMATION   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL PROGRAMMING; NONLINEAR PROGRAMMING; PROBLEM SOLVING;

IMPLICIT PROGRAMMING APPROACH (IMP); MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS (MPCC); MATHEMATICAL PROGRAMS WITH EQUILIBRIUM CONSTRAINTS (MPEC); OPTIMIZATION PROBLEMS;

OPTIMIZATION;

EID: 23944434405     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-004-0539-2     Document Type: Conference Paper

References (64)

1. Anitescu, M.: On solving mathematical programs with complementarity constraints as nonlinear programs. Preprint ANL/MCS-P864-1200, Argonne National Laboratory Argonne IL, 2000
2. Aubin, J.P., Frankowska, H.: Set-valued analysis. Birkhäuser Boston, 1990
3. Bard, J.F.: A grid search algorithm for the linear bilevel programming problem. In: Proc. of the 14th Annual Meeting of the American Institute for Decision Science, 1982, pp. 256-258
4. Ben-Tal, A., Bendsöe, M.: A new iterative method for optimal trass topology design. SIAM J. Optim. 3, 322-358 (1993)
5. Benson, H., Sen, A., Shanno, D., Vanderbei, R.: Interior-point algorithms penalty methods andequilibrium problems. Technical Report ORFE-03-02, Operations Research and Financial Engineering Princeton University, October 2003
6. Beremlijski, P., Haslinger, J., Kočvara, M., Outata, J.V.: Shape optimization in contact problems with coulomb friction. SIAM J. Optim. 13 (2), 561-587 (2002)
7. Byrd, R., Hribar, M.E., Nocedal, J.: An interior point method for large scale. Nonl. Program. SIAM J. Optim. 9 (4), 877-900 (1999)
8. Chen, Y., Florian, M.: The nonlinear bilevel programming problem: Formulations regularity and optimality conditions. Optimization 32, 193-209 (1995)
9. Clarke, F.H.: Optimization and nonsmooth analysis. J. Wiley & Sons New York, 1983
10. Dempe, S.: A simple algorithm for the linear bilevel programming problem. Optimization 18, 373-385 (1987)
11. Dempe, S.: Foundations of bilevel programming. Kluwer Acad. Publ. Dordrecht-Boston-London, 2002
12. Dempe, S.: Annotated bibliography on bilevel programming and mathematical programs with equilibrium constraints. Preprint, Freiberg Univ. of Mining and Technology Freiberg, Oct. 2002
13. Dontchev, A.L., Hager, W.W.: Implicit functions lipschitz maps and stability inoptimization. Math. Oper. Res. 19, 753-768 (1994)
14. Dontchev, A.L., Rockafellar, R.T.: Characterization of strong regularityfor variational inequalities over polyhedral convex sets. SIAM J. Optim. 7, 1087-1105 (1996)
15. Facchinei, F., Jiang, H., Qi, L.: A smoothing method for mathematical programs with equilibrium constraints. Math. Program. 85, 107-134 (1999)
16. Ferris, M., Kanzow, C.: Complementarity and related problems handbook of applied optimization. In: P.M. Pardalos, M.G.C. Resende (eds.), Oxford University Press, New York, 2002, pp. 514-530
17. Fletcher, R., Leyffer, S.: Nonlinear programming without a penalty function. Math. Program. 91, 239-269 (2002)
18. Fletcher, R., Leyffer, S.: Solving mathematical programs with complementary constraints as nonlinear programs. Optimization Methods and Software 19, 15-40 (2004)
19. Fletcher, R., Leyffer, S., Ralph, D., Scholtes, S.: Local convergence of SQP methods for Mathematical Programs with Equilibrium Constraints. Report NA209, University of Dundee, 2002
20. Friesz, T.L., Anandalingam, G., Mehta, N.J., Nam, K., Shah, S.J., Tobin, R.L.: The multiobjective equilibrium network design problem revisited: A simulated annealing approach. Eur. J. Oper. Res. 65, 44-57 (1993)
21. Gill, P.E., Murray, W., Sounders, M.A.: SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM J. Optim. 12, 979-1006 (2002)
22. Glowinski, R.: Numerical methods for nonlinear variational problems. Springer-Verlag New York, 1984
23. Griewank, A.: Evaluating Derivatives Principles and Techniques of Algorithmic Differentiation. Number 19 in Frontiers in Appl. Math. SIAM Philadelphia, 2000
24. Harker, P.T., Pang, J.-S.: On the existence of optimal solutions to mathematical program with equilibrium constraints. Oper. Res. Lett. 7, 61-64 (1988)
25. Haslinger, J., Dostál, Z., Kučera, R.: Signorini problem with a given friction based on the reciprocal variational formulation. In: D.Y. Gao, R.W. Ogden, G.E. Stavroulakis (eds.), Nonsmooth/Nonconvex Mechanics: Modeling Analysis and Numerical Methods, Kluwer Acad. Publ. Dordrecht, 2001
26. Haslinger, J., Hlaváček, I., Nečas, J.: Numerical Methods for Unilateral Problems in Solid Mechanics. In: P.G. Ciarlet, J.L. Lions (eds.), Handbook of Numerical Analysis, Vol. IV, North-Holland, 1996, pp. 313-185
27. Hiriart-Urruty, J.-B., Lemaréchal, C.: Convex analysis and minimization algorithms. Springer-Verlag Berlin-Heidelberg, 1993
28. Jiang, H., Ralph, D.: Smooth SQP methods for mathematical programs with nonlinear complementarity constraints. SIAM J. Optim. 10, 779-808 (2000)
29. Júdice, J., Faustino, A.: The linear-quadratic bilevel programming problem. Ann. Oper. Res. 34, 89-106 (1992)
30. Kinderlehrer, D., Stampaccia, G.: An introduction to variational inequalities and their application. Academic Press New York, 1980
31. Kočvara, M., Outrata, J. V.: Effective Reformulations of the Truss Topology Design Problem. IMA Preprint 1917, Univerisity of Minnesota, Minneapolis, March 2003
32. Kočvara, M., Stingl, M.: PENNON - A Code for Convex Nonlinear and Semidefinite Programming. Optim. Methods Softw. 18, 317-333 (2003)
33. Kuntz, L., Scholtes, S.: A nonsmooth variant of the Mangasarian-Fromowitz constraint qualification. J. Optim. Theor. Appl. 82, 59-75 (1994)
34. Leyffer, S.: The penalty interior point method fails to converge for mathematical programs with equilibrium constraints. Report NA208, University of Dundee, 2002
35. Liu, G.S., Zhang, J.Z.: A new branch and bound algorithm for solving quadratic programs with linear complementarity cosntraints. J. Comp. Appl. Math. 146, 77-87 (2002)
36. De Luca, T., Facchinei, F., Kanzow, C.: A theoretical and numerical comparison of some semismooth algorithms for complementarity problems. Com. Optim. Appl. 16, 173-205 (2000)
37. Luo, Z.-Q., Pang, J.-S., Ralph, D.: Mathematical programs with equilibrium constraints. Cambridge University Press, Cambridge, 1996
38. Luo, Z.-Q., Pang, J.-S., Ralph, D., Wu, S.Q.: Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints. Math. Program. 75, 19-76 (1996)
39. Mordukhovich, B.S.: Generalized differential calculus for nonsmooth and set-valuedmappings. J. Math. Anal. Appl. 183, 250-288 (1994)
40. Mordukhovich, B.S.: Lipschitzian stability of constraint systems and generalizedequations. Nonl. Anal. 22, 173-206 (1994)
41. Mordukhovich, B.S.: Coderivative analysis of variational systems. Dept. of Mathematics, Wayne State University. J. Global Optim. 28, 347-362 (2004)
42. Mordukhovich, B.S., Outrata, J.V.: On second-order subdifferentials and their applications. SIAM J. Optim. 12, 139-169 (2001)
43. Murtagh, B.A., Saunders, M.A.: MINOS 5.5 User's Guide Dept of Operations Research. Report SOL 83-20R, Stanford University, 1998
44. Outrata, J.V.: Optimality conditions for a class of mathematical programs with equilibrium constraints. Math. Oper. Res. 24, 627-644 (1999)
45. Outrata, J.V.: A generalized mathematical program with equilibrium constraints. SIAM J. Control. Optim. 38, 1623-1638 (2000)
46. Outrata, J.V.: On mathematical programs with complementarity cosntraints. Optim. Methods Softw. 14, 117-137 (2000)
47. Outrata, J.V., Kočvara, M., Zowe, J.: Nonsmooth approach to optimization problems with equilibrium constraints. Theory Applications and Numerical Results, Kluwer Acad. Publ. Dordrecht-Boston-London, 1998
48. Panagiotopoulos, P.D.: Inequality problems in mechanics and applications convex and nonconvex energy functions. Birkhäuser Basel, 1985
49. Pang, J.-S.: Error bounds in mathematical programming. Math. Program. 79, 299-332 (1997)
50. Pang, J.S., Han, S.P., Rangaraj, N.: Minimization of locally Lipschitzian functions. SIAM J. Optim. 1, 57-82 (1991)
51. Qi, L., Sun, J.: A nonsmooth version of Newton's method. Math. Program. 58, 353-368 (1993)
52. Raghunathan, A.U., Biegler, L.T.: Interior point methods for mathematical programs with complementarity constraints (MPCCs). CAPD Technical Report, Department of Chemical Engineering Carnegie Mellon University, Pittsburgh PA 15213, June 2003
53. Robinson, S.M.: Generalized equations and their solutions Part 1: Basictheory. Math. Program. Study 10, 128-141 (1979)
54. Robinson, S.M.: Strongly regular generalized equations. Math. Oper. Res. 5, 43-62 (1980)
55. Robinson, S.M.: An implicit-function theorem for a class of nonsmooth functions. Math. Oper. Res. 16, 292-309 (1991)
56. Rockafellar, R.T., Wets, R.: Variational Analysis. Springer Verlag, Berlin, 1998
57. Scheel, H., Scholtes, S.: Mathematical programs with equilibrium constraints: Stationarity optimality and sensitivity. Math. Oper. Res. 25 (1), 1-22 (2000)
58. Scholtes, S.: Introduction to piecewise differential equations. Habilitation Thesis. Institut für Statistik und Mathematische Wirtschaftstheorie, Universität Karlsruhe, Germany, 1994
59. Scholtes, S.: Convergence Properties of a Regularisation Scheme for Mathematical Programs with Complementarity Constraints. SIAM J. Optim. 11 (4), 918-936 (2001)
60. Scholtes, S., Stöhr, M.: Exact penalisation of mathematical programs with equilibrium constraints. SIAM J. Contr. Optim. 37 (2), 617-652 (1999)
61. Schramm, H., Zowe, J.: A version of the bundle idea for minimizing a nonsmooth function: conceptual idea convergence analysis numerical results. SIAM J. Optim. 2, 121-152 (1992)
62. Stackelberg, H.v.: Marktform und Gleichgewicht. Springer Verlag Berlin 1934, Engl. transi.: The Theory of the Market Economy. Oxford Univ. Press, 1952
63. Vanderbei, R.J., Shanno, D.F.: An interior point algorithm for nonconvex nonlinear programming. Com. Optim. Appl. 13, 231-252 (1999)
64. Ye, J.J., Zhu, D.L., Zhu, Q.J.: Exact penalization and necessary optimality conditions for generalized bilevel programming problems. SIAM J. Optim. 7, 481-507 (1997)