On the equivalence of linear complementarity problems

Operations Research Letters

Volumn 30, Issue 4, 2002, Pages 211-222

  De Schutter, B ^a   Heemels, W P M H ^b   Bemporad, A ^c  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c UNIVERSITY OF SIENA   (Italy)

Author keywords

Complementarity problems; Integer programming; Linear complementarity problem; Nonlinear algorithms; Optimization

Indexed keywords

ALGEBRA; ALGORITHMS; INTEGER PROGRAMMING;

LINEAR COMPLEMENTARITY PROBLEMS (LCP);

LINEAR PROGRAMMING;

EID: 0036699487     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(02)00159-1     Document Type: Article

References (46)

1. Bai Z.Z. On the convergence of the multisplitting methods for the linear complementarity problem. SIAM J. Matrix Anal. Appl. 21(1):1999;67-78.
2. Bemporad A., Morari M. Control of systems integrating logic, dynamics, and constraints. Automatica. 35(3):1999;407-427.
3. Chen C., Mangasarian O.L. Smoothing methods for convex inequalities and linear complementarity problems. Math. Programming. 71(1):1995;51-69.
4. Cordier C., Marchand H., Laundy R., Wolsey L.A. bc-opt: A branch-and-cut code for mixed integer programs. Math. Programming Ser. A. 86(2):1999;335-353.
5. Cottle R.W., Dantzig G.B. A generalization of the linear complementarity problem. J. Combin. Theory. 8(1):1970;79-90.
6. Cottle R.W., Pang J.S., Stone R.E. The Linear Complementarity Problem. 1992;Academic Press, Boston.
7. De Moor B., Vandenberghe L., Vandewalle J. The generalized linear complementarity problem and an algorithm to find all its solutions. Math. Programming. 57:1992;415-426.
8. De Schutter B. Optimal control of a class of linear hybrid systems with saturation. SIAM J. Control Optim. 39(3):2000;835-851.
9. De Schutter B., De Moor B. The extended linear complementarity problem. Math. Programming. 71(3):1995;289-325.
10. De Schutter B., De Moor B. Minimal realization in the max algebra is an extended linear complementarity problem. Systems Control Lett. 25(2):1995;103-111.
11. De Schutter B., De Moor B. The linear dynamic complementarity problem is a special case of the extended linear complementarity problem. Systems Control Lett. 34(1-2):1998;63-75.
12. De Schutter B., De Moor B. Optimal traffic light control for a single intersection. European J. Control. 4(3):1998;260-276.
13. De Schutter B., van den Boom T. Model predictive control for max-min-plus systems. Boel R., Stremersch G. Discrete Event Systems: Analysis and Control. The Kluwer International Series in Engineering and Computer Science. Vol. 569:2000;201-208 Kluwer Academic Publishers, Boston.
14. Eaves B.C. The linear complementarity problem. Manage. Sci. 17(9):1971;612-634.
15. Eaves B.C., Lemke C.E. Equivalence of LCP and PLS. Math. Oper. Res. 6(4):1981;475-484.
16. M.C. Ferris, J.S. Pang (Eds.), Complementarity and Variational Problems: State of the Art, SIAM, Philadelphia, Pennsylvania, 1997 (Proceedings of the International Conference on Complementarity Problems, Baltimore, MD, November 1995).
17. Ferris M.C., Pang J.S. Engineering and economic applications of complementarity problems. SIAM Rev. 39(4):1997;669-713.
18. Fletcher R., Leyffer S. Numerical experience with lower bounds for MIQP branch-and-bound. SIAM J. Optim. 8(2):1998;604-616.
19. Gowda M.S. On the extended linear complementarity problem. Math. Programming. 72:1996;33-50.
20. Gowda M.S., Sznajder R. The generalized order linear complementarity problem. SIAM J. Matrix Anal. Appl. 15(3):1994;779-795.
21. Güler O. Generalized linear complementarity problems. Math. Oper. Res. 20(2):1995;441-448.
22. Harker P.T., Pang J.S. Finite-dimensional variational inequality and nonlinear complementarity problems. a survey of theory, algorithms and applications Math. Programming Ser. B. 48(2):1990;161-220.
23. Heemels W.P.M.H., De Schutter B., Bemporad A. Equivalence of hybrid dynamical models. Automatica. 37(7):2001;1085-1091.
24. Heemels W.P.M.H., Schumacher J.M., Weiland S. Linear complementarity systems. SIAM J. Appl. Math. 60(4):2000;1234-1269.
25. Júdice J.J., Vicente L.N. On the solution and complexity of a generalized linear complementarity problem. J. Global Optim. 4(4):1994;415-424.
26. Kaliski J.A., Ye Y. An extension of the potential reduction algorithm for linear complementarity problems with some priority goals. Linear Algebra Appl. 193:1993;35-50.
27. Kanzow C. Some noninterior continuation methods for linear complementarity problems. SIAM J. Matrix Anal. Appl. 17(4):1996;851-868.
28. Kočvara M., Zowe J. An iterative two-step algorithm for linear complementarity problems. Numer. Math. 68(1):1994;95-106.
29. Kremers H., Talman D. A new pivoting algorithm for the linear complementarity problem allowing for an arbitrary starting point. Math. Programming. 63(2):1994;235-252.
30. Leenaerts D.M.W., van Bokhoven W.M.G. Piecewise Linear Modeling and Analysis. 1998;Kluwer Academic Publishers, Boston.
31. C.E. Lemke, Recent results on complementarity problems. in: J.B. Rosen, O.L. Mangasarian, K. Ritter (Eds.), Nonlinear Programming (Proceedings of a symposium conducted by the Mathematics Research Center, University of Wisconsin, Madison, Wisconsin, May 1970), Academic Press. New York, 1970. pp. 349-384.
32. Mangasarian O.L., Pang J.S. The extended linear complementarity problem. SIAM J. Matrix Anal. Appl. 16(2):1995;359-368.
33. Mehrotra S., Stubbs R.A. Predictor-corrector methods for a class of linear complementarity problems. SIAM J. Optim. 4(2):1994;441-453.
34. Mohan S.R., Neogy S.K., Sridhar R. The generalized linear complementarity problem revisited. Math. Programming. 74:1996;197-218.
35. Murty K.G. Linear Complementarity, Linear and Nonlinear Programming. 1988;Helderman Verlag, Berlin, Germany.
36. Pang J.S., Gabriel S.A. NE/SQP. A robust algorithm for the nonlinear complementarity problem Math. Programming. 60(3):1993;295-337.
37. Pardalos P.M. Linear complementarity problems solvable by integer programming. Optimization. 19(4):1988;467-474.
38. J.M. Schumacher, Some modeling aspects of unilaterally constrained dynamics, in: Proceedings of the ESA International Workshop on Advanced Mathematical Methods in the Dynamics of Flexible Bodies, ESA-ESTEC, Noordwijk, The Netherlands, June 1996.
39. Sheng R., Potra F.A. A quadratically convergent infeasible-interior-point algorithm for LCP with polynomial complexity. SIAM J. Optim. 7(2):1997;304-317.
40. Sherali H.D., Krishnamurthy R.S., Al-Khayyal F.A. Enhanced intersection cutting-plane approach for linear complementarity problems. J. Optim. Theory Appl. 90(1):1996;183-201.
41. 0 - and P -properties; extended vertical and horizontal linear complementarity problems Linear Algebra Appl. 223/224:1995;695-715.
42. Taha H.A. Operations Research: an Introduction. 4th Edition:1987;Macmillan Publishing Company, New York.
43. Tütüncü R.H., Todd M.J. Reducing horizontal linear complementarity problems. Linear Algebra Appl. 223/224:1995;717-729.
44. A.J. van der Schaft, J.M. Schumacher, Hybrid systems modelling and complementarity problems, in: Proceedings of the European Control Conference (ECC'97), Brussels, Belgium, Paper 868, July 1997.
45. Wright S.J. An infeasible-interior-point algorithm for linear complementarity problems. Math. Programming. 67(1):1994;29-51.
46. Ye Y. A fully polynomial-time approximation algorithm for computing a stationary point of the general linear complementarity problem. Math. Oper. Res. 18(2):1993;334-345.