Solving mathematical programs with complementarity constraints as nonlinear programs

Optimization Methods and Software

Volumn 19, Issue 1 SPEC. ISS., 2004, Pages 15-40

  Fletcher, Roger ^a   Leyffer, Sven ^b  

^a UNIVERSITY OF DUNDEE   (United Kingdom)

^b ARGONNE NATIONAL LABORATORY   (United States)

Author keywords

Complementarity constraints; Interior point methods; MPCC; Nonlinear programming; Sequential quadratic programming

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); CONSTRAINT THEORY; DATA STRUCTURES; DIGITAL LIBRARIES; ITERATIVE METHODS; LAGRANGE MULTIPLIERS; LINEARIZATION; PROBLEM SOLVING; QUADRATIC PROGRAMMING; SET THEORY;

INTERIOR-POINT METHODS; MATHEMATICAL PROGRAMS WITH COMPLEMENTARITY CONSTRAINTS; NONLINEAR PROGRAMS; SEQUENTIAL QUADRATIC PROGRAMMING;

NONLINEAR PROGRAMMING;

EID: 1542346047     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556780410001654241     Document Type: Article

References (34)

1. M.C. Ferris and J.S. Pang (1997). Engineering and economic applications of complementarity problems. SIAM Review, 39(4), 669-713.
2. Z.-Q. Luo, J.-S. Pang and D. Ralph (1996). Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge, UK.
3. J. Outrata, M. Kocvara and J. Zowe (1998). Nonsmooth Approach to Optimization Problems with Equilibrium Constraints. Kluwer Academic Publishers, Dordrecht.
4. S. Leyffer. (2000). MacMPEC: AMPL collection of MPECs. Webpage, www.mcs.anl.gov/leyffer/MacMPEC/.
5. Y. Chen and M. Florian (1995). The nonlinear bilevel programming problem: Formulations, regularity and optimality conditions. Optimization, 32, 193-209.
6. H. Scheel and S. Scholtes (2000). Mathematical program with complementarity constraints: Stationarity, optimality and sensitivity. Mathematics of Operations Research, 25, 1-22.
7. R. Fletcher, S. Leyffer, D. Ralph and S. Scholtes (2002). Local convergence of SQP methods for mathematical programs with equilibrium constraints. Numerical Analysis Report NA/209, Department of Mathematics, University of Dundee, Dundee, UK, May 2002.
8. M. Anitescu (2000). On Solving Mathematical Programs with Complementarity Constraints as Nonlinear Programs. Preprint ANL/MCS-P864-1200. MCS Division, Argonne National Laboratory, Argonne, UL. Submitted to SIAM J. Optimization.
9. P.E. Gill, W. Murray and M.A. Saunders (1997). SNOPT: An SQP algorithm for large-scale constrained optimization. Report NA 97-2, Dept. of Mathematics, University of California, San Diego, November 1997.
10. J.F. Bard (1988). Convex two-level optimization. Mathematical Programming, 40(1), 15-27.
11. A.R. Conn, N.I.M. Gould and Ph.L. Toint (1996). Numerical experiments with the Lancelot package (Release A) for large-scale nonlinear optimization. Mathematical Programming, 73(1), 73-110.
12. M.C. Ferris and C. Kanzow (1999). Complementarity and related problems: A survey. Mathematical Programming Technical Report 98-17, University of Wisconsin, August 1999.
13. M.C. Ferris and F. Tin-Loi (1998). Nonlinear programming approach for a class of inverse problems in elastoplasticity. Structural Engineering and Mechanics, 6, 857-870.
14. F. Facchinei, H. Jiang, and L. Qi (1999). A smoothing method for mathematical programs with equilibrium constraints. Mathematical Programming, 85, 107-134.
15. H. Jiang and D. Ralph (2000). Smooth SQP methods for mathematical programs with nonlinear complementarity constraints. SIAM J. Optimization, 10, 779-808.
16. M. Fukushima, Z.Q. Luo and J.-S. Pang (1998). A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints. Computational Optimization and Applications, 10(1), 5-34.
17. S. Leyffer (2002). The penalty interior point method fails to converge. Numerical Analysis Report NA/208, Department of Mathematics, University of Dundee, Dundee, UK, February 2002. Revised Sept. 2003.
18. S.P. Dirkse and M.C. Ferris (1999). Modelling and solution environments for MPEC: GAMS & MATLAB. In: M. Fukushima and L. Qi (Eds.), Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods. Kluwer Academic, Dordrecht.
19. S.P. Dirkse, M.C. Ferris and A. Meeraus (2002). Mathematical programs with equilibrium Constraints: Automatic reformulation and solution via constraint optimization. Technical Report NA-02/11, Oxford University Computing Laboratory, July 2002.
20. R. Fletcher and S. Leffer (2002). Nonlinear programming without a penalty function. Mathematical Programming, 91, 239-270.
21. R. Fourer, D.M. Gay and B.W. Kernighan (2003). AMPL: A Modelling Language for Mathematical Programming. Books/Cole - Thomson Learning, 2nd ed.
22. S. Leyffer (2003). Complementarity constraints as nonlinear equations: Theory and numerical experience. Technical report, Argonne National Laboratory, 2003.
23. B. Fourer, M.C. Ferris and D.M. Gay (1999). Expressing complementarity problems and communicating them to solvers. SIAM Journal on Optimization, 9, 991-1009.
24. I. Bongartz, A.R. Conn, N.I.M. Gould and Ph.L. Toint (1995). CUTE: Constrained and unconstrained testing environment. ACM Transactions on Mathematical Software, (21), 123-160.
25. S.C. Billups, S.P. Dirkse and M.C. Ferris (1997). A comparison of large scale mixed complementarity problem solvers. Computational Optimization and Applications, 7, 3-25.
26. J. Czyzyk, M. Mesnier and J. Moré (1998). The NEOS server. IEEE Journal on Computational Science and Engineering, 5, 68-75. Try it at www-neos.mcs.anl.gov/neos/!
27. R. Fletcher, S. Leyffer and Ph.L. Toint (1998). On the global convergence of an SLP-filter algorithm. Numerical Analysis Report NA/183, University of Dundee, UK, August 1998.
28. R.H. Byrd, M.E. Hribar and J. Nocedal (1999). An interior point algorithm for large scale nonlinear programming. SIAM J. Optimization, 9(4), 877-900.
29. R.J. Vanderbei and D.F. Shanno (1999). An interior point algorithm for nonconvex nonlinear programming. COAP, 13, 231-252.
30. A. Raghunathan and L.T. Biegler (2002). Barrier methods for mathematical programs with complementarity constraints (MPCCs). Technical report, Carnegie Mellon University, Department of Chemical Engineering, Pittsburgh, PA, December 2002.
31. H. Benson, D.F. Shanno and R.V.D. Vanderbei (2002). Interior-point methods for nonconvex nonlinear programming: Complementarity constraints. Technical Report ORFE 02-02, Princeton University, Operations Research and Financial Engineering.
32. E.D. Dolan and Jorge Moré (2000). Benchmarking Optimization Software with Cops. Technical report MCS-TM-246, MCS Division, Argonne Laboratory, Argonne IL, November 2000.
33. S.P. Dirkse and M.C. Ferris (1999). Modeling and solution environments for mpec: Gams & matlab. In: M. Fukushima and L. Qi (Eds.), Reformulation: Nonsmooth, Piecewise Smooth, Semismooth and Smoothing Methods, pp. 127-148. Kluwer Academic Publishers.
34. Z.-Q. Luo, J.-S. Pang, D. Ralph and S.-Q. Wu (1996). Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints. Mathematical Programming, 75(1), 19-76.