On linear programs with linear complementarity constraints

Journal of Global Optimization

Volumn 53, Issue 1, 2012, Pages 29-51

  Hu, Jing ^a   Mitchell, John E ^b   Pang, Jong Shi ^c   Yu, Bin ^d  

^a Market Analytics Inc   (United States)

^b Research Rensselaer Polytechnic Institute   (United States)

^c University of Illinois at Urbana Champaign   (United States)

^d RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Cross validated support vector regression; Hierarchical programming; Inverse programming; Linear programs with linear complementarity constraints; Piecewise linear programming; Quantile minimization

Indexed keywords

BILEVEL; BROAD APPLICATION; CONSTRAINED OPTIMIZATION PROBLEMS; HIERARCHICAL PROGRAMMING; LINEAR COMPLEMENTARITY; LINEAR OPTIMIZATION; LINEAR PROGRAMS; MATHEMATICAL PROGRAM WITH EQUILIBRIUM CONSTRAINTS; NONCONVEX; QUADRATIC PROGRAMS; SUPPORT VECTOR REGRESSION (SVR); UNIFIED FRAMEWORK;

CONSTRAINED OPTIMIZATION; INVERSE PROBLEMS; PIECEWISE LINEAR TECHNIQUES;

LINEAR PROGRAMMING;

EID: 84860307146     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-010-9644-3     Document Type: Article

References (58)

1. Ahmed S., Shapiro A.: Solving chance-constrained stochastic programs via sampling and integer programming. In: Chen, Z.L., Raghavan, S. (eds) TutORials in Operations Research, chapter 12, pp. 261-269. INFORMS, London (2008)
2. R.K. Ahuja J.B. Orlin 2001 Inverse optimization Oper. Res. 49 5 771 783 10.1287/opre.49.5.771.10607 (Pubitemid 34011327)
3. G. Anandalingam T.L. Friesz 1992 Hierarchical optimization: an introduction Ann. Oper. Res. 34 1 1 11 10.1007/BF02098169
4. C. Audet G. Savard W. Zghal 2007 New branch-and-cut algorithm for bilevel linear programming J. Optim. Theory Appl. 38 2 353 370 10.1007/s10957-007-9263- 4
5. E. Balas 1971 Intersection cuts-a new type of cutting planes for integer programming Oper. Res. 19 19 39 10.1287/opre.19.1.19
6. E. Balas S. Ceria G. Cornuéjols 1993 A lift-and-project cutting plane algorithm for mixed 0-1 programs Math. Program. 58 295 324 10.1007/BF01581273
7. E. Balas M. Perregaard 2002 Lift-and-project for mixed 0-1 programming: recent progress Dis. Appl. Math. 123 1-3 129 154 10.1016/S0166-218X(01)00340-7 (Pubitemid 34775572)
8. E. Balas M. Perregaard 2003 A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer Gomory cuts for 0-1 programming Math. Program. 94 2-3 221 245 10.1007/s10107-002-0317-y
9. Bennett, K.P., Ji, X., Hu, J., Kunapuli, G., Pang, J.-S.: Model selection via bilevel programming. In: Proceedings of the International Joint Conference on Neural Networks (IJCNN'06) Vancouver, pp. 1922-1929. B.C. Canada, July 16-21 (2006) (Pubitemid 351369560)
10. S. Burer D. Vandenbussche 2008 A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations Math. Program. 113 2 259 282 10.1007/s10107-006-0080-6 (Pubitemid 351177972)
11. S. Burer D. Vandenbussche 2009 Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound Comput. Optim. Appl. 43 2 181 195 10.1007/s10589-007-9137-6
12. M.W. Chang C.J. Lin 2005 Leave-one-out bounds for support vector regression model selection Neural Comput. 17 1188 1222 10.1162/0899766053491869 (Pubitemid 40551618)
13. O. Chapelle V. Vapnik O. Bousquet S. Mukherjee 2002 Choosing multiple parameters with support vector machines Mach. Learn. 46 131 159 10.1023/A:1012450327387 (Pubitemid 34129966)
14. K.W. Chung W.C. Kao C.L. Sun L.L. Wang C.J. Lin 2003 Radius margin bounds for support vector machines with the RBF kernel Neural Comput. 15 2643 2681 10.1162/089976603322385108 (Pubitemid 37206930)
15. B. Colson P. Marcotte G. Savard 2007 An overview of bilevel optimization Ann. Oper. Res. 153 1 235 256 10.1007/s10479-007-0176-2
16. Cottle, R.W., Pang, J.S., Stone, R.E.: The linear complementarity problem. SIAM Classics in Applied Mathematics 60, Philadelphia (2009) [Originally published by Academic Press, Boston (1992)]
17. Dempe S.: Foundations of Bilevel Programming. Kluwer, Dordrecht (2002)
18. Dempe, S., Dutta, J.: Is bilevel programming a special case of a mathematical program with complementarity constraints? Math. Program (2010) (online first)
19. Facchinei F., Pang J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems: vols. I and II. Springer, New York (2003)
20. Floudas C.A., Pardalos P.M.: A Collection of Test Problems for Constrained Global Optimization Algorithms, vol. 455 of Lecture Notes in Computer Science. Springer, New York (1990)
21. Floudas C.A., Pardalos P.M., Adjiman C., Esposito W.R., Gümüs Z.H., Harding S.T., Klepeis J.L., Meyer C.A., Schweiger C.A.: Handbook of Test Problems in Local and Global Optimization, vol. 33 of Nonconvex Optimization and its Applications. Kluwer, Dordrecht (1999)
22. Giannessi, F., Tomasin, E.: Nonconvex quadratic programs, linear complementarity problems, and integer linear programs. In: Conti, R., Ruberti, A. (eds.) Fifth Conference on Optimization Techniques (Rome 1973), Part I, vol. 3 of Lecture Notes in Computer Science, pp. 437-449. Springer, Berlin (1973)
23. B. Grone C.R. Johnson E. Marques de Sa H. Wolkowicz 1984 Positive definite completions of partial Hermitian matrices Lin. Alg. Appl. 58 109 124 10.1016/0024-3795(84)90207-6
24. Horn R.A., Johnson C.: Matrix Analysis. Cambridge University Press, Cambridge (1985)
25. Horst R., Pardalos P.M., Thoai N.V.: Introduction to Global Optimization, 2nd edn, Vol. 48 of Nonconvex Optimization and its Applications. Kluwer, Dordrecht (2000)
26. Hu, J.: On linear programs with linear complementarity constraints. PhD thesis, Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY 12180, August (2009)
27. Hu, J., Mitchell, J.E., Pang, J.S.: An LPCC approach to nonconvex quadratic programs. Technical report, Department of Mathematical Sciences, Rensselaer Polytechnic Institute, Troy, NY 12180. Accepted for publication in Mathematical Programming. May (2008)
28. J. Hu J.E. Mitchell J.S. Pang K.P. Bennett G. Kunapuli 2008 On the global solution of linear programs with linear complementarity constraints SIAM J. Optim. 19 1 445 471 10.1137/07068463x
29. G. Iyengar W. Kang 2005 Inverse conic programming with applications Oper. Res. Lett. 33 3 319 330 10.1016/j.orl.2004.04.007
30. Keha, A.B.: A polyhedral study of nonconvex piecewise linear optimization. PhD thesis, Industrial Engineering, Georgia Institute of Technology, Atlanta, GA, August (2003)
31. A.B. Keha I.R. de Farias Jr.G.L. Nemhauser 2004 Models for representing piecewise linear cost functions Oper. Res. Lett. 32 1 44 48 10.1016/S0167- 6377(03)00059-2
32. A.B. Keha I.R. de Farias Jr G.L. Nemhauser 2006 A branch-and-cut algorithm without binary variables for nonconvex piecewise linear optimization Oper. Res. 54 5 847 858 10.1287/opre.1060.0277 (Pubitemid 44546525)
33. Kunapuli, G., Hu, J., Bennett, K.P., Pang, J.S.: Bilevel model selection for support vector machines. In: Data Mining and Mathematical Programming, vol 45 of CRM Proceedings and Lecture Notes, pp. 129-158. Centre de Recherches Mathématiques (2008)
34. G. Kunapuli J. Hu K.P. Bennett J.S. Pang 2008 Classification model selection via bilevel programming Optim. Methods Softw. 23 4 475 489 10.1080/10556780802102586
35. K. Krishnan J.E. Mitchell 2006 A unifying framework for several cutting plane methods for semidefinite programming Optim. Methods Softw. 21 1 57 74 10.1080/10556780500065283 (Pubitemid 43019117)
36. L. Lovász A. Schrijver 1991 Cones of matrices and set-functions and 0-1 optimization SIAM J. Optim. 1 2 166 190 10.1137/0801013
37. Luedtke, J.: Integer programming approaches for some non-convex and stochastic optimization problems. PhD thesis, Industrial and Systems Engineering, Georgia Institute of Technology (2007)
38. Luo Z.-Q., Pang J.-S., Ralph D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge (1996)
39. J.-S. Pang M. Fukushima 1999 Complementarity constraint qualifications and simplified B-stationarity conditions for mathematical programs with equilibrium constraints Comput. Optim. Appl. 13 1-3 111 136 10.1023/A: 1008656806889 (Pubitemid 129574938)
40. J.-S. Pang S. Leyffer 2004 On the global minimization of the Value-at-Risk Optim. Methods Softw. 19 5 611 631 10.1080/10556780410001704911
41. Pardalos, P.M.: The linear complementarity problem. In: Gomez, S., Hennart, J.P. (eds.) Advances in Optimization and Numerical Analysis, pp. 39-49 (1994)
42. Prékopa A.: Probabilistic programming. In: Ruszczynski, A., Shapiro, A. (eds) Stochastic Programming, chapter 5, Handbooks in Operations Research and Management Science, vol. 10., Elsevier, Amsterdam (2003)
43. Qualizza, A., Belotti, P., Margot, F.: Linear programming relaxations of quadratically constrained quadratic programs. IMA Volume Series Springer, accepted (2010)
44. R.T. Rockafellar S. Uryasev 2000 Optimization of conditional value-at-risk J. Risk 2 21 41
45. R.T. Rockafellar S. Uryasev 2002 Conditional value-at-risk for general loss distribution J. Bank. Finance 26 1443 1471 10.1016/S0378-4266(02)00271-6
46. A. Saxena P. Bonami J. Lee 2010 Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations Math. Program. 124 1-2 383 411 10.1007/s10107-010-0371-9
47. Saxena, A., Bonami, P., Lee, J.: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations. Technical Report RC24695, IBM. Accepted for publication in Mathematical Programming August (2008)
48. H. Scheel S. Scholtes 2000 Mathematical programs with complementarity constraints: stationarity, optimality, and sensitivity Math. Oper. Res. 25 1 1 22 10.1287/moor.25.1.1.15213
49. Scholtes, S.: Active set methods for inverse linear complementarity problems. Technical report, Judge Institute of Management Science, Cambridge University, Cambridge CB2 1AG, November (1999)
50. H.D. Sherali W.P. Adams 1990 A hierarchy of relaxation between the continuous and convex hull representations for zero-one programming problems SIAM J. Dis. Math. 3 411 430 10.1137/0403036
51. H.D. Sherali B.M.P. Fraticelli 2002 Enhancing RLT relaxations via a new class of semidefinite cuts J. Global Optim. 22 233 261 10.1023/A:1013819515732
52. D. Vandenbussche G.L. Nemhauser 2005 A branch-and-cut algorithm for nonconvex quadratic programs with box constraints Math. Program. 102 3 559 575 10.1007/s10107-004-0550-7 (Pubitemid 40536654)
53. D. Vandenbussche G.L. Nemhauser 2005 A polyhedral study of nonconvex quadratic programs with box constraints Math. Program. 102 3 531 557 10.1007/s10107-004-0549-0 (Pubitemid 40536653)
54. Vapnik V.: Statistical Learning Theory. Wiley-Interscience, New York (1998)
55. J.P. Vielma S. Ahmed G.L. Nemhauser 2010 Mixed-integer models for nonseparable piecewise linear optimization: Unifying framework and extensions Oper. Res. 58 2 303 315 10.1287/opre.1090.0721
56. J.P. Vielma A.B. Keha G.L. Nemhauser 2008 Nonconvex, lower semicontinuous piecewise linear optimization Dis. Optim. 5 2 467 488 10.1016/j.disopt.2007.07. 001 (Pubitemid 351443135)
57. X. Xiao L. Zhang J. Zhang 2009 A smoothing Newton method for a type of inverse semi-definite quadratic programming problem J. Comput. Appl. Math. 223 1 485 498 10.1016/j.cam.2008.01.028
58. J. Zhang L. Zhang 2010 An augmented Lagrangian method for a type of inverse quadratic programming problems Appl. Math. Optim. 61 1 57 83 10.1007/s00245-009-9075-z