The general quadratic programming problem is a typical multiextrernal optimization problem, which can have local optima different from global optima. This chapter presents an overview of actual results on general quadratic programming, focusing on three topics: optimality conditions, duality and solution methods. Optimality conditions and solution methods are discussed in the sense of global optimization.


Global Optimization Quadratic Programming Positive Semidefinite Quadratic Programming Problem Trust Region Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Al-Khayyal, F.A. and Falk, J.E. (1983). Jointly constrained biconvex programming. Mathematics of Operations Research, 8:273–286.MathSciNetCrossRefGoogle Scholar
  2. Al-Khayyal, F.A., Larsen, C., and van Voorhis, T. (1995). A relaxation method for nonconvex quadratically constrained quadratic programs. Journal of Global Optimization, 6:215–230.CrossRefGoogle Scholar
  3. Audet, C., Hansen, P., Jaumard, B., and Savard, G. (2000). A branch and cut algorithm for nonconvex quadratically constrained quadratic programming. Mathematical Programming, A87:131–152.MathSciNetGoogle Scholar
  4. Bazaraa, M.S., Sherali, H.D., and Shetty, C.M. (1993). Nonlinear Programming: Theory and Algorithms. 2nd edition, John Wiley & Sons, Inc.Google Scholar
  5. Ben-Tal, A., Eiger, G., and Gershovitz, V. (1994). Global minimization by reducing the duality gap, Mathematical Programming, 63:193–212.MathSciNetCrossRefGoogle Scholar
  6. Bomze, I.M. (1998). On standard quadratic optimization problems. Journal of Global Optimization, 13:369–387.zbMATHMathSciNetCrossRefGoogle Scholar
  7. Bomze, I.M. (2002). Branch and bound approaches to standard quadratic optimization problems. Journal of Global Optimization, 22:17–37.zbMATHMathSciNetCrossRefGoogle Scholar
  8. Bomze, I.M. and Danninger, G. (1993). A global optimization algorithm for concave quadratic problems. SIAM Journal on Optimization, 3:826–842.MathSciNetCrossRefGoogle Scholar
  9. Brimberg, J., Hansen, P., and Mladenović, N. (2002). A note on reduction of quadratic and bilinear programs with equality constraints. Journal of Global Optimization, 22:39–47.CrossRefGoogle Scholar
  10. Dür, M. and Horst, R. (1997). Lagrange duality and partioning techniques in nonconvex global optimization. Journal of Optimization Theory and Applications, 95:347–369.MathSciNetCrossRefGoogle Scholar
  11. Falk, J.E. and Hoffman, K.L. (1976). A successive underestimation method for concave minimization problems. Mathematics of Operations Research, 1:251–259.Google Scholar
  12. Flippo, O.E. and Jansen, B. (1996). Duality and sensitivity in nonconvex quadratic optimization over an ellipsoid. European Journal of Operations Research, 94:167–178.CrossRefGoogle Scholar
  13. Floudas, C.A., Aggarwal, A., and Ciric, A.R. (1989). Global optimum search for nonconvex NLP and MINLP problems. Computers and Chemical Engineering, 13:1117–1132.CrossRefGoogle Scholar
  14. Floudas, C.A. and Visweswaran, V. (1990). A global optimization algorithm (GOP) for certain classes of nonconvex NLPs-I. Theory. Computers and Chemical Engineering, 14:1397–1417.CrossRefGoogle Scholar
  15. Floudas, C.A. and Visweswaran, V. (1995). Quadratic optimization. In: R. Horst and P.M. Pardalos (eds.), Handbook of Global Optimization, pp. 217–269. Kluwer Academic Publihers.Google Scholar
  16. Fujie, T. and Kojima, M. (1997). Semidefinite programming relaxation for nonconvex quadratic programs. Journal of Global Optimization, 10:367–380.MathSciNetCrossRefGoogle Scholar
  17. Geoffrion, A.M. (1971). Duality in nonlinear programming: A simplified application-oriented development, SIAM Review, 13:1–37.zbMATHMathSciNetCrossRefGoogle Scholar
  18. Han, C.G., Pardalos, P.M., and Ye, Y. (1992). On the solution of indefinite quadratic problems using an interior point algorithm. Informatica, 3:474–496.MathSciNetGoogle Scholar
  19. Hansen, P. and Jaumard, B. (1992). Reduction of indefinite quadratic programs to bilinear programs. Journal of Global Optimization, 2:41–60.MathSciNetCrossRefGoogle Scholar
  20. Hansen, P., Jaumard, B., Ruiz, M., and Xiong, J. (1993). Global optimization of indefinite quadratic functions subject to box constraints. Naval Research Logistics, 40:373–392.MathSciNetGoogle Scholar
  21. Heinkenschloss, M. (1994). On the solution of a two ball trust region subproblem. Mathematical Programming, 64:249–276.zbMATHMathSciNetCrossRefGoogle Scholar
  22. Hiriart-Urruty, J.-B. (1989). From convex to nonconvex optimization. In: Nonsmooth Optimization and Related Topics, Plenum, New York, pp. 217–268.Google Scholar
  23. Hiriart-Urruty, J.-B. (1998). Conditions for global optimization. II. Journal of Global Optimization, 13:349–367.zbMATHMathSciNetCrossRefGoogle Scholar
  24. Hiriart-Urruty, J.-B. (2001). Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints. Journal of Global Optimization, 21:445–455.MathSciNetCrossRefGoogle Scholar
  25. Horst, R. and Pardalos, P.M. (eds.). (1995). Handbook of Global Optimization. Kluwer Academic Publishers, Dordrecht.Google Scholar
  26. Horst, R., Pardalos, P.M., and Thoai, N.V. (2000). Introduction to Global Optimization, 2nd edition. Kluwer, Dordrecht, The Netherlands.Google Scholar
  27. Horst, R. and Thoai, N.V. (1996). A new algorithm for solving the general quadratic programming problem. Computational Optimization and Applications, 5:39–49.MathSciNetCrossRefGoogle Scholar
  28. Horst, R. and Thoai, N.V. (1999). DC programming: Overview. Journal of Optimization Theory and Applications, 103:1–43.MathSciNetCrossRefGoogle Scholar
  29. Horst, R., Thoai, N.V., and Benson, H.P. (1991). Concave minimization via conical partitions and polyhedral outer approximation. Mathematical Programming, 50:259–274.MathSciNetCrossRefGoogle Scholar
  30. Horst, R. and Tuy, H. (1996). Global Optimization: Deterministic Approaches. 3rd edition. Springer, Berlin.Google Scholar
  31. Kojima, M. and Tunnel, L. (2000). Cones of matrix and successive convex relaxations of nonconvex sets. SIAM Journal on Optimization, 10:750–778.MathSciNetCrossRefGoogle Scholar
  32. Kojima, M. and Tunçel, L. (2000). Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization. Mathematical Programming, A89:79–111.CrossRefGoogle Scholar
  33. Konno, H. (1976). Maximizing a convex quadratic function subject to linear constraints. Mathematical Programming, 11:117–127.zbMATHMathSciNetCrossRefGoogle Scholar
  34. Le Thi, H.A. and Pham, D.T. (1997). Solving a class of linearly constrained indefinite quadratic problems by d.c. algorithm. Journal of Global Optimization, 11: 253–285.CrossRefGoogle Scholar
  35. Le Thi, H.A. and Pham, D.T. (1998). A branch and bound method via d.c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems. Journal of Global Optimization, 13:171–206.CrossRefGoogle Scholar
  36. Locatelli, M. and Raber, U. (2002). Packing equal circles into a square: A deterministic global optimization approach. Discrete Apllied Mathematics, 122:139–166.MathSciNetCrossRefGoogle Scholar
  37. Lovász, L. and Schrijver, A. (1991). Cones of matrices and set functions and 0–1 optimization. SIAM Journal on Optimization, 1:166–190.MathSciNetCrossRefGoogle Scholar
  38. Mangasarian, O.L. (1979). Nonlinear Programming. Robert E. Krieger Publishing Company, Huntington, New York, 1979.Google Scholar
  39. Martinez, J.M. (1994). Local minimizers of quadratic functions on Euclidean balls and spheres. SIAM Journal on Optimization, 4:159–176.zbMATHMathSciNetCrossRefGoogle Scholar
  40. Moré, J. (1993). Generalizations of the trust region problem. Optimization Methods & Software 2:189–209.Google Scholar
  41. Novak, I. (1999). A new semidefinite bound for indefinite quadratic forms over a simplex. Journal of Global Optimization, 14:357–364.CrossRefGoogle Scholar
  42. Novak, I. (2000). Dual bounds and optimality cuts for all-quadratic programs with convex constraints. Journal of Global Optimization, 18:337–356.CrossRefGoogle Scholar
  43. Pardalos, P.M. (1991). Global optimization algorithms for linearly constrained indefinite quadratic problems. Computers & Mathematics with Applications, 21:87–97.zbMATHMathSciNetCrossRefGoogle Scholar
  44. Pardalos, P.M. and Rosen, J.B. (1987). Constrained global optimization: Algorithms and applications, Lecture Notes in Computer Science, vol. 268. Springer, Berlin.Google Scholar
  45. Pardalos, P.M. and Vavasis, S.A. (1991). Quadratic programming with one negative eigenvalue is NP-hard. Journal of Global Optimization, 1:843–855.MathSciNetGoogle Scholar
  46. Pardalos, P.M, Ye, Y., and Han, C.G. (1991). Algorithms for the solution of quadratic knapsack problems. Linear Algebra & its Applications, 152:69–91.MathSciNetCrossRefGoogle Scholar
  47. Peng, J.M. and Yuan, Y. (1997). Optimality conditions for the minimization of a quadratic with two quadratic constraints. SIAM Journal on Optimization, 7:579–594.MathSciNetCrossRefGoogle Scholar
  48. Pham Dinh Tao and Le Thi Hoai An. (1995). Lagrangian stability and global optimality in nonconvex quadratic minimization over Euclidean balls and spheres. Joournal of Convex Analysis, 2:263–276.Google Scholar
  49. Pham Dinh Tao and Le Thi Hoai An. (1998). d.c. optimization algorithm for solving the trust region subproblem. SIAM Journal on Optimization, 8:1–30.MathSciNetCrossRefGoogle Scholar
  50. Phong, T.Q., Pham Dinh Tao, and Le Thi Hoai An. (1995). A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem. Journal of Global Optimization, 6:87–105.CrossRefGoogle Scholar
  51. Raber, U. (1998). A simplicial branch and bound method for solving nonconvex all-quadratic programs. Journal of Global Optimization, 13:417–432.zbMATHMathSciNetCrossRefGoogle Scholar
  52. Rendl, F. and Wolkowicz, H. (1997). A semidefinite framework for trust region subproblems with applications to large scale minimization. Mathematical Programming, B77:273–299.MathSciNetCrossRefGoogle Scholar
  53. Sahni, S. (1974). Computationally related problems. SIAM Journal on Computing, 3:262–279.MathSciNetCrossRefGoogle Scholar
  54. Sherali, H.D. and Adams, W.P. (1990). A hierarchy of relations between the continuous and convex hull representations of zero-one programming problems. SIAM Journal on Discrete Mathematics 3:411–430.MathSciNetCrossRefGoogle Scholar
  55. Sherali, H.D. and Adams, W.P. (1999). A Refomulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems. Kluwer Academic Publihers.Google Scholar
  56. Sherali, H.D. and Tuncbilek, C.H. (1995). A reformulation-convexification approach for solving nonconvex quadratic programming problems. Journal of Global Optzmization, 7:1–31.MathSciNetCrossRefGoogle Scholar
  57. Shor, N.Z. (1998). Nondifferentiable optimization and polynomial problems. Kluwer Academic Publihers.Google Scholar
  58. Shor, N.Z. and Stetsyuk, P.I. (2002). Lagrangian bounds in multiextremal polynomial and discrete optimization problems. Journal of Global Optimization, 23:1–41.MathSciNetCrossRefGoogle Scholar
  59. Stern, R. and Wolkowicz, H. (1995). Indefinite trust region subproblems and nonsymmetric eigenvalue perturbation. SIAM Journal on Optimization, 5:286–313.MathSciNetCrossRefGoogle Scholar
  60. Takeda, A., Dai, Y., Fukuda, M., and Kojima, M. (2000). Towards the implementation of successive convex relaxation method for nonconvex quadratic optimization problems. In: P. Pardalos (ed.), Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems. Kluwer Academic Publishers.Google Scholar
  61. Takeda, A., Fujisawa, K., Fukaya, Y., and. Kojima, M. (2002). Parallel implementation of successive convex relation methods for quadratic optimization problems. Journal of Global Optimization, 24:237–260.MathSciNetCrossRefGoogle Scholar
  62. Thoai, N.V. (1998). Global optimization techniques for solving the general quadratic integer Programming problem. Computational Optimization and Applications 10:149–163.zbMATHMathSciNetCrossRefGoogle Scholar
  63. Thoai, N.V. (2000). Duality bound method for the general quadratic programming problem with quadratic constraints. Journal of Optimization Theory and Applications, 107:331–354.zbMATHMathSciNetCrossRefGoogle Scholar
  64. Thoai, N.V. (2002). Convergence and application of a decomposition method using duality bounds for nonconvex global optimization. Journal of Optimization Theory and Applications, 113:165–193.zbMATHMathSciNetCrossRefGoogle Scholar
  65. Vandenberghe, L. and Boyd, S. (1996). Semidefinite programming. SIAM Review, 38:49–95.MathSciNetCrossRefGoogle Scholar
  66. Visweswaran, V. and Floudas, C.A. (1990). A global optimization algorithm (GOP) for certain classes of nonconvex NLPs-II. Application of theory and test problems. Computers and Chemical Engineering, 14:1419–1434.CrossRefGoogle Scholar
  67. Yajima, Y. and Fujie, T. (1998). A polyhedral approach for nonconvex quadratic programming problems with box constraints. Journal of Global Optimization, 13:151–170.MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2005

Authors and Affiliations

  • Nguyen Van Thoai

There are no affiliations available

Personalised recommendations