Copositive realxation for genera quadratic programming

References

• Bazaraa , M.S. , Sherali , H.D. and Shetty , C.M. 1993 . Nonlinear Programming. Theory and Algorithms , John Wiley and Sons .
   Google Scholar
• Bellare , M. and Rogaway , P. 1995 . The complexity of approximating a nonlinear program . Mathematical Programming , 69 : 429 – 441 .
   Web of Science ®Google Scholar
• Bomze , I.M. 1996 . Block pivoting and shortcut strategies for detecting copositivity . Linear Algebra and its Applications , 248 : 161 – 184 .
   Web of Science ®Google Scholar
• Bomze , I.M. and Danninger , G. 1993 . A global optimization algorithm for concaje quadratic programming problems . Siam J. Optimization , 3 ( 4 ) : 826 – 842 .
   Google Scholar
• Bomze , I.M. and Danninger , G. 1994 . A Finite Algorithm for Solving General Quadratic Problems . Journal of Global Optimization , 4 ( 4 ) : 1 – 16 .
   Google Scholar
• Cottle , R.W. , Habetler , G.J. and Lemke , C.E. 1970 . On classes of coposithf matrices . Linear Algebra and its Applications , 3 ( 4 ) : 279 – 294 .
   Google Scholar
• Cottle , R.W. , Habetler , G.J. and Lemke , C.E. Quadratic forms semi-defi nite over convex cones . Proceedings of the Princeton Sympo slum on Mathematical Programming . Edited by: Kuhn , H.W. pp. 551 – 565 .
   Google Scholar
• Diananda , P.H. On non-negative forms in real variables some or all of which are non-negative . Proceedings of the Cambridge Philosophical Society . Vol. 58 , pp. 17 – 25 .
   Google Scholar
• Goemans , M.X. and Williamson , D.P. 1995 . Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming . Jonnal ofAssoc. Comput. Mack , 42 : 1115 – 1145 .
   Web of Science ®Google Scholar
• Güler , O. 1997 . Hyperbolic polynomials and interior point methods for convelx programing . Mathematics of Operations Research , 22 ( 2 )
   Google Scholar
• Hadeler , K.P. 1983 . On copositive matrices . Linear Algebra and its Application , 49 ( 2 ) : 79 – 89 .
   Google Scholar
• Hall , M. Jr and Newman , M. Copositive and completely positive quadrat-forms . Proceedings of the Cambridge Philosophical Society . Vol. 59 , pp. 329 – 339 .
   Google Scholar
• Jarre , F. 1996 . “ Interior-point methods for classes of convex programs ” . In Interior point methods of mathematical programming , Edited by: Terlaky , T. 255 – 296 . Dordrecht : Kluwer .
   Google Scholar
• Lovász , L. and Schrijver , A. 1991 . Cones of matrices and set-functions and 0-1 optimization . SIAM Journal on Optimization , 1 : 166 – 190 .
   Web of Science ®Google Scholar
• Martin , D.H. 1981 . Finite criteria for conditional definiteness of quadratic forms . Linear Algebra and its Applications , 39 : 9 – 21 .
   Web of Science ®Google Scholar
• Martin , D.H. and Jacobson , D.H. 1981 . Copositive matrices and definiteness d>f quadratic forms subject to homogeneous linear inequality constraints . Linear Algebra and its Applications , 35 : 227 – 258 .
   Web of Science ®Google Scholar
• Motzkin , T.S. 1967 . Inequalities , Edited by: Shisha , O. 225 – 240 . Academ Press .
   Google Scholar
• Murty , K.G. 1987 . Some NP-complete problems in quadratic and nonlinear programming . Mathematical Programming , 39 : 117 – 129 .
   Web of Science ®Google Scholar
• Nesterov , Yu and Nemirovskii , A.S. 1994 . “ Interior Point Polynomial Algorithm in Convex Programming ” . In SIAM Studies in Applied Mathematics , Vol. 13 , Philadephia : SIAM .
   Google Scholar
• Nesterov , Yu . 1997 . “ Quality of semidefinite relaxation for nonconvex quadratic optimization ” . In CORE Discussion paper Vol. 9719 , Belgium
   Google Scholar
• Papadimitriou , C.H. and Steiglitz , K. 1982 . Combinatorial Optimization , Princeton-Hall .
   Google Scholar
• Poljak , S. , Rendl , F. and Wolkowicz , H. 1995 . A Recipe for Semidefinite Relation for (0,1)-Quadratic Programming . Journal of Global Optimization , 7 ( 1 ) : 51 – 73 .
   Web of Science ®Google Scholar
• Ramana , M.V. 1993 . “ An Algorithmic Analysis of Multiquadratic and Semidefinite Programming Problems ” . In PhD thesis , Baltimore : The Johns Hopkins University .
   Google Scholar
• Ramana , M. 1997 . An exact duality theory for semidefinite programming and complexity implications . Mathematical Programming , 77 ( 2 ) Series B
   Google Scholar
• Ramana , M.V. and Pardalos , P.M. 1996 . Interior point methods of mathematical programming , Edited by: Terklay , T. 369 – 398 . Dordrecht, Kluwer : The Netherlands .
   Google Scholar
• Shor , N.Z. 1987 . Quadratic optimization problems . Soviet Journal of Computer and System Sciences , 25 ( 6 ) : 1 – 11 .
   Google Scholar
• Väliaho , H. 1986 . Criteria for copositive matrices . Linear Algebra and its Applications , 81 ( 6 ) : 19 – 34 .
   Google Scholar
• Väliaho , H. 1988 . Testing the definiteness of matrices on polyhedral cones . Linear Algebra and its Applications , 101 ( 6 ) : 135 – 165 .
   Google Scholar
• Väliaho , H. 1989 . Quadratic-programming criteria for copositive matrices . Linear Algebra and its Applications , 119 ( 6 ) : 163 – 182 .
   Google Scholar
• Vandenberghe , L. and Boyd , S. 1996 . Semidefinite programming . SIAM Review , 38 ( 6 ) : 49 – 95 .
   Google Scholar
• Wolkowicz , H. 1981 . Optimization applied in matrix theory . Linear Algebra and its Applications , 40 ( 6 ) : 101 – 118 .
   Google Scholar
• Ye , Y. 1997 . Approximating quadratic programming with bound constraints , Iowa City, , USA : University of Iowa . Working paper, Dept. of Management Science
   Google Scholar
• Ye , Y. 1997 . Approximating quadratic programming with quadratic constraints , Iowa City, , USA : University of Iowa . Working paper, Dept. of Management Science
   Google Scholar