Summary
Recently, it has been shown that mathematical programs with complementarity constraints (MPCCs) can be solved efficiently and reliably as nonlinear programs. This paper examines various nonlinear formulations of the complementarity constraints. Several nonlinear complementarity functions are considered for use in MPCC. Unlike standard smoothing techniques, however, the reformulations do not require the control of a smoothing parameter. Thus they have the advantage that the smoothing is exact in the sense that Karush-Kuhn-Tucker points of the reformulation correspond to strongly stationary points of the MPCC. A new exact smoothing of the well-known min function is also introduced and shown to possess desirable theoretical properties. It is shown how the new formulations can be integrated into a sequential quadratic programming solver, and their practical performance is compared on a range of test problems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Anitescu. Global convergence of an elastic mode approach for a class of mathematical programs with complementarity constraints. SIAM J. Optimization, 16(1):120–145, 2005.
J. F. Bard. Convex two-level optimization. Mathematical Programming, 40(1):15–27, 1988.
H. Benson, A. Sen, D. F. Shanno, and R. V. D. Vanderbei. Interior-point algorithms, penalty methods and equilibrium problems. Technical Report ORFE-03-02, Princeton University, Operations Research and Financial Engineering, October 2003. To appear in Computational Optimization and Applications.
B. Chen, X. Chen, and C. Kanzow. A penalized Fischer-Burmeister NCP-function. Mathematical Programming, 88(1):211–216, June 2000.
Y. Chen and M. Florian. The nonlinear bilevel programming problem: Formulations, regularity and optimality conditions. Optimization, 32:193–209, 1995.
B. Chen and P. T. Harker. Smooth approximations to nonlinear complementarity problems. SIAM J. Optimization, 7(2):403–420, 1997.
S. P. Dirkse, M. C. Ferris, and A. Meeraus. Mathematical programs with equilibrium constraints: Automatic reformulation and solution via constraint optimization. Technical Report NA-02/11, Oxford University Computing Laboratory, July 2002.
S. P. Dirkse. MPEC world. Webpage, GAMS Development Corp., www.gamsworld.org/mpec/, 2001.
Elizabeth D. Dolan and Jorge Moré. Benchmarking optimization software with cops. Technical Report MCS-TM-246, MCS Division, Argonne National Laboratory, Argonne, IL, November 2000.
R. Fourer, D. M. Gay, and B. W. Kernighan. AMPL: A Modelling Language for Mathematical Programming. Books/Cole—Thomson Learning, 2nd edition, 2003.
R. Fletcher, N. I. M. Gould, S. Leyffer, Ph. L. Toint, and A. Wächter. Global convergence of trust-region SQP-filter algorithms for general nonlinear programming. SIAM J. Optimization, 13(3):635–659, 2002.
A. Fischer. A Newton-type method for positive semi-definite linear complementarity problems. Journal of Optimization Theory and Applications, 86:585–608, 1995.
F. Facchinei, H. Jiang, and L. Qi. A smoothing method for mathematical programs with equilibrium constraints. Mathematical Programming, 85:107–134, 1999.
R. Fletcher and S. Leyffer. Nonlinear programming without a penalty function. Mathematical Programming, 91:239–270, 2002.
R. Fletcher and S. Leyffer. Solving mathematical program with complementarity constraints as nonlinear programs. Optimization Methods and Software, 19(1):15–40, 2004.
R. Fletcher. Practical Methods of Optimization, 2nd edition. John Wiley, Chichester, 1987.
R. Fletcher, S. Leyffer, D. Ralph, and S. Scholtes. 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. To appear in SIAM J. Optimization.
R. Fletcher, S. Leyffer, and Ph. L. Toint. On the global convergence of a filter-SQP algorithm. SIAM J. Optimization, 13(1):44–59, 2002.
M. C. Ferris and J. S. Pang. Engineering and economic applications of complementarity problems. SIAM Review, 39(4):669–713, 1997.
P.E. Gill, W. Murray, and M.A. Saunders. SNOPT: An SQP algorithm for large-scale constrained optimization. SIAM Journal on Optimization, 12(4):979–1006, 2002.
H. Jiang and D. Ralph. QPECgen, a MATLAB generator for mathematical programs with quadratic objectives and affine variational inequality constraints. Computational Optimization and Applications, 13:25–59, 1999.
S. Leyffer. MacMPEC: AMPL collection of MPECs. Webpage, www.mcs.anl.gov/~leyffer/MacMPEC/, 2000.
Z.-Q. Luo, J.-S. Pang, and D. Ralph. Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge, UK, 1996.
X. Liu and J. Sun. Generalized stationary points and an interior point method for mathematical programs with equilibrium constraints. Mathematical Programming B, 101(1):231–261, 2004.
T. S. Munson, F. Facchinei, M. C. Ferris, A. Fischer, and C. Kanzow. The semismooth algorithm for large scale complementarity problems. INFORMS J. Computing, 13(4):294–311, 2001.
J. Outrata, M. Kocvara, and J. Zowe. Nonsmooth Approach to Optimization Problems with Equilibrium Constraints. Kluwer Academic Publishers, Dordrecht, 1998.
A. Raghunathan and L. T. Biegler. Barrier methods for mathematical programs with complementarity constraints (MPCCs). Technical report, Carnegie Mellon University, Department of Chemical Engineering, Pittsburgh, PA, December 2002.
A. Raghunathan and L. T. Biegler. MPEC formulations and algorithms in process engineering. Technical report, Carnegie Mellon University, Department of Chemical Engineering, Pittsburgh, PA, 2002.
A. Raghunathan and L. T. Biegler. An interior point method for mathematical programs with complementarity constraints (MPCCs). SIAM Journal on Optimization, 15(3):720–750, 2005.
H. Scheel and S. Scholtes. Mathematical program with complementarity constraints: Stationarity, optimality and sensitivity. Mathematics of Operations Research, 25:1–22, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer Science + Business Media, LLC
About this chapter
Cite this chapter
Leyffer, S. (2006). Complementarity constraints as nonlinear equations: Theory and numerical experience. In: Dempe, S., Kalashnikov, V. (eds) Optimization with Multivalued Mappings. Springer Optimization and Its Applications, vol 2. Springer, Boston, MA . https://doi.org/10.1007/0-387-34221-4_9
Download citation
DOI: https://doi.org/10.1007/0-387-34221-4_9
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34220-7
Online ISBN: 978-0-387-34221-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)