Skip to main content
SpringerLink
Log in

Quadratic Programming with Box Constraints

  • Chapter
Developments in Global Optimization

Part of the book series: Nonconvex Optimization and Its Applications ((NOIA,volume 18))

Abstract

The global minimization of quadratic problems with box constraints naturally arises in many applications and as a subproblem of more complex optimization problems. In this paper we briefly describe the main results on global optimality conditions. Moreover, some of the most interesting computational approaches for the problem will be summarized.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Abbreviations

BCQP:

box constrained quadratic problem

KKT:

Karush, Kuhn, Tucker stationarity conditions.

References

  1. H.H. Benson. Concave Minimization: Theory, Applications and Algorithms. Handbook of Global Optimization (Eds: R. Horst and P.M. Pardalos), Kluwer, 43–142, (1995).

    Google Scholar 

  2. I.M. Bomze. Copositivity Conditions for Global Optimality in Indefinite Quadratic Programming Problems. Czechoslovak J. for OR 1:7–19, (1992).

    MATH  Google Scholar 

  3. I.M. Bomze and G. Danninger. A Global Optimization Algorithm for Concave Quadratic Problems. Siam J. Optim., 3:826–842, (1993).

    Article  MathSciNet  MATH  Google Scholar 

  4. I.M. Bomze and G. Danninger. A Finite Algorithm for Solving General Quadratic Problems. J. of Glo. Optim., 4:1–16, (1994).

    Article  MathSciNet  MATH  Google Scholar 

  5. T.F. Coleman and L.A. Hulbert. A direct active set algorithm for large sparse quadratic programs with simple bounds. Mathematical Programming, 45:373–406 (1989).

    Article  MathSciNet  MATH  Google Scholar 

  6. A.R. Conn, N.I.M. Gould, and P.L. Toint. Lancelot. A Fortran Package for Large-Scale Nonlinear Optimization. Springer-Verlag, (1992).

    MATH  Google Scholar 

  7. G. Danninger. Role of Copositivity in Optimality Criteria for Nonconvex Optimization Problems. J. of Optim. Theory and Appl., 75:535–558, (1992).

    Article  MathSciNet  MATH  Google Scholar 

  8. R. Fletcher and M.P. Jackson. Minimization of a quadratic function of many variables subject only to lower and upper bounds. J. Inst. Maths Applics, 14:159–174 (1974).

    Article  MathSciNet  MATH  Google Scholar 

  9. C.A. Floudas and V. Visweswaran. Quadratic Optimization, Handbook of Global Optimisation (Eds: R. Horst and P.M. Pardalos), Kluwer, 217–270, (1995).

    Google Scholar 

  10. M. Frank and P. Wolfe. An algorithm for quadratic programming. Naval Res. Logist. Quart., 3:95–110 (1956).

    Article  MathSciNet  Google Scholar 

  11. P.E. Gill, W. Murray, M.A. Saunders, and M.H. Wright. User’s guide for SOL/QPSOL: A Fortran Package for Quadratic Programming TECHNICAL REPORT SOL 83–7.

    Google Scholar 

  12. P.E. Gill, W. Murray, M.A. Saunders, and M.H. Wright. Inertia-controlling methods for general quadratic programming. SIAM Review, 33 (1) :1–36 (1991).

    Article  MathSciNet  MATH  Google Scholar 

  13. L. Grippo and S. Lucidi. A differentiable Exact Penalty Function for Bound Constrained Quadratic Programming Problems. Optimization, 22 (4): 557–578, (1991).

    Article  MathSciNet  MATH  Google Scholar 

  14. S. Gupta and P.M. Pardalos. A note on a quadratic formulation for linear complementarity problems. JOTA, 57(1): 197–202 (1988).

    Article  MathSciNet  MATH  Google Scholar 

  15. W.W. Hager, P.M. Pardalos, I.M. Roussos, and H.D. Sahinoglou. Active constraints, indefinite quadratic test problems, and complexity. JOTA, 68(3):499–511 (1991).

    Article  MathSciNet  MATH  Google Scholar 

  16. C.G. Han, P.M. Pardalos, and Y. Ye. Computational aspects of an interior point algorithm for quadratic programming problems with box constraints. Large-Scale Numerical Optimization (Eds: T.F. Coleman and Y. Li), SIAM, 92–112 (1990).

    Google Scholar 

  17. C.G. Han, P.M. Pardalos, and Y. Ye. On the Solution of Indefinite Quadratic Problems Using an Interior Point Algorithm. Informatica, 3(4):474–496, (1992).

    MathSciNet  MATH  Google Scholar 

  18. P. Hansen, B. Jaumard, M. Ruiz, and J. Xiong. Global Minimization of Indefinite Quadratic functions Subject to Box Constraints. Nav. Research Log., 40:373–392, (1993).

    Article  MathSciNet  MATH  Google Scholar 

  19. J.B. Hiriart-Urruty. From Convex Optimization to Nonconvex Optimization. Part I: Necessary and Sufficient Conditions for Global Optimality. Nonsmooth Optimization and Related Topics, Plenum Press, 219–239 (1989).

    Google Scholar 

  20. J.B. Hiriart-Urruty. Conditions for Global Optimality. Handbook of Global Optimisation (Eds: R. Horst and P.M. Pardalos), Kluwer, 1–26 (1995).

    Google Scholar 

  21. J.B. Hiriart-Urruty and C. Lemarechal. Testing Necessary and Sufficient Conditions for Global Optimality in the Problem of Maximizing a Convex Quadratic function over a Convex Polyhedron. Seminaire d’Analyse Numerique, Univ. P. Sabatier de Tonlose, (1990).

    Google Scholar 

  22. R. Horst, P.M. Pardalos, and N.V. Thoai. Introduction to Global Optimization, Kluwer (1995).

    MATH  Google Scholar 

  23. Optimization Subroutine Library Guide and Reference Release 2. IBM Corporation, (1991).

    Google Scholar 

  24. F. John, Collected papers, vol2, Extremum problems with inequalities as subsidiary Conditions (J. Moser ed.) Birkhäuser, Boston, 543–560.

    Google Scholar 

  25. D.S. Johnson, C.H. Papadimitriou and M. Yannakakis. How Easy is Local Search? J. of Comp. and Syst. Science, 37:79–100, (1988).

    Article  MathSciNet  MATH  Google Scholar 

  26. J. Judice and M. Pires. Direct Methods for Convex Quadratic Programs subject to Box Constraints. Investicação Operacional, 9:23–56, (1989).

    Google Scholar 

  27. W. Li. Differentiable Piecewise Quadratic Exact Penalty Functions for Quadratic Programs with Simple bound Constraints. Dept. of Math. and Stat., Old Dominion University, Norfolk, (1994)

    Google Scholar 

  28. W. Li. Differentiable Piecewise Quadratic Exact Penalty Functions for Quadratic Programs via Hestenes-Powell-Rockafellar’s Augmented Lagrangian Function. Dept. of Math. and Stat., Old Dominion University, Norfolk, (1994)

    Google Scholar 

  29. P. Kamath and N.K. Karmarkar. An O(nL) iteration algorithm for computing bounds in quadratic optimization problems, In P.M. Pardalos (ed), Complexity in Numerical Optimization. World Scientific, 1993.

    Google Scholar 

  30. M.K. Kozlov, S.P. Tarasov, and L.G. Khachian. Polynomial solvability of convex quadratic programming. Soviet Math. Dokl., 20:1108–1111, (1979).

    MATH  Google Scholar 

  31. H.W. Kuhn and A.W. Tucker. Nonlinear programming, Proc. 2nd Berkeley Symposium Math. Stat. Prob., (J. Neyman ed.) Univ. of California Press, Berkeley, California, 481–492, 1951.

    Google Scholar 

  32. M. Manas. An Algorithm for a Nonconvex Programming Problem. Econ. Math. Obzor Acad. Nacl. Ceskoslov 4:202–212, (1968).

    MathSciNet  Google Scholar 

  33. M. Minoux. Mathematical programming, theory and algorithms. New York Wiley (1986).

    MATH  Google Scholar 

  34. J.J. Moré and D.C. Sorensen. Computing a Trust Region Step. SIAM J. Sci. Stat. Comput., 4:553–572 (1983).

    Article  MATH  Google Scholar 

  35. J.J. Moré and G. Toraldo. Algorithms for Bound Constrained Quadratic Programming Problems Numer. Math., 55:377–400, (1989).

    Article  MathSciNet  MATH  Google Scholar 

  36. J.J. Moré and G. Toraldo. On the Solution of Large Quadratic Programming Problems with Bound Constraints. SIAM J. Optim., 1:93–113, (1991).

    Article  MathSciNet  MATH  Google Scholar 

  37. K.G. Murty and S.N. Kabadi. Some NP-complete problems in quadratic and nonlinear programming. Mathematical Programming, 39:117–129 (1987).

    Article  MathSciNet  MATH  Google Scholar 

  38. B.A. Murtagh and M.A. Saunders. MINOS 5.0 User’s Guide. Tech. Rep. SOL 83–20, Syst. Opt. Lab., Dept. Oper. Res., Stanford Univ., (1986).

    Google Scholar 

  39. A. Neumaier. An optimality criterion for global quadratic optimization. J. of Glo. Optim., 2:201–208 (1992).

    Article  MathSciNet  MATH  Google Scholar 

  40. A. Neumaier. Second-order sufficient optimality conditions for local and global nonlinear programming. Journal of Global Optimization, to appear, (1995).

    Google Scholar 

  41. P.M. Pardalos. Polynomial Time Algorithms for some Classes of Constrained Non-convex Quadratic Problems. Optimization 21:843–853, (1990).

    Article  MathSciNet  MATH  Google Scholar 

  42. P.M. Pardalos. Integer and Separable Programming Techniques for Large Scale Optimization Problems. PhD thesis, Computer Sc. Dept. Univ. of Minnesota, (1985).

    Google Scholar 

  43. P.M. Pardalos. Global Optimisation Algorithms for Linearly Constrained Indefinite Quadratic Problems. Comp. and Math. with Appl. 21:87–97, (1991).

    Article  MathSciNet  MATH  Google Scholar 

  44. P.M. Pardalos, J.H. Glick, and J.B. Rosen. Global Minimization of Indefinite Quadratic problems. Computing 39:281–291, (1987).

    Article  MathSciNet  MATH  Google Scholar 

  45. P.M. Pardalos and M.G.C. Resende. Interior Point Methods for Global Optimization. In Interior point methods in mathematical programming, T. Terlaky (ed.), Kluwer Academic Publishers, 1996.

    Google Scholar 

  46. P.M. Pardalos, G.P. Rodgers. Computational Aspects of Branch and Bound Algorithm for Quadratic Zero-one Programming. Computing 45,131–144, (1990).

    Article  MathSciNet  MATH  Google Scholar 

  47. P.M. Pardalos and J.B. Rosen. Methods for Global Concave Minimization: A Bibliographic Survey. SIAM Review 28:367–379, (1986).

    Article  MathSciNet  MATH  Google Scholar 

  48. P.M. Pardalos and J.B. Rosen. Constrained Global Optimization: Algorithms and Applications. Springer-Verlag, Lecture Notes in Computer Science 268, (1987).

    Book  MATH  Google Scholar 

  49. P.M. Pardalos and G. Schnitger. Checking local optimality in constrained quadratic programming is NP-hard. Operations Research Letters, 7(1):33–35, (1988).

    Article  MathSciNet  MATH  Google Scholar 

  50. P.M. Pardalos and S.A. Vavasis. Quadratic programming with one negative eigenvalue is NP-hard. Journal of Global Optimization, 1(1):15–22, (1991).

    Article  MathSciNet  MATH  Google Scholar 

  51. A.T. Phillips and J.B. Rosen. A Parallel Algorithm for Constrained Concave Quadratic Global Minimization. Math. Program. 42:421–448, (1988).

    Article  MathSciNet  MATH  Google Scholar 

  52. A.T. Phillips and J.B. Rosen. A Parallel Algorithm for Partially Separable Non-Convex Global Minimization: Linear Constraints. A. of Oper. Research 25:101–118, (1990).

    Article  MathSciNet  MATH  Google Scholar 

  53. J.B. Rosen. Global Minimization of a linearly constrained Concave Function by partition of feasible domain. Math. Oper. Res., 8:215–230, (1983).

    Article  MathSciNet  MATH  Google Scholar 

  54. J.B. Rosen and P.M. Pardalos. Global Minimization of Large-Scale Constrained Concave Quadratic Problems by Separable Programming. Math. Program. 34:163–174, (1986).

    Article  MathSciNet  MATH  Google Scholar 

  55. H.D. Sherali and A. R. Alameddine. A New Reformulation-Linearization Technique for Bilinear Programming Problems. J. of Glob. Optim., 2:379–410, (1992).

    Article  MathSciNet  MATH  Google Scholar 

  56. H.D. Sherali and C.H. Tuncbilek. A global Optimization Algorithm for Polynomial Programming Problems Using a Reformulation-Linearization Technique. J. of Glob. Optim., 2:101–112, (1992).

    Article  MathSciNet  MATH  Google Scholar 

  57. H.D. Sherali and C.H. Tuncbilek. A Reformulation-Convexification Approach for Solving Nonconvex Quadratic Programming Problems. J. of Glob. Optim., 7:1–31, (1995).

    Article  MathSciNet  MATH  Google Scholar 

  58. D.C. Sorensen. Newton’s method with a model trust region modification. SIAM J. Numer. Anal., 19:409–426, (1982).

    Article  MathSciNet  MATH  Google Scholar 

  59. S.A. Vavasis. Nonlinear Optimization: Complexity Issues. Oxford University Press, (1991).

    MATH  Google Scholar 

  60. S.A. Vavasis. Approximate algorithms for indefinite quadratic programming. Mathematical Programming, 57:279–311, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  61. S.A. Vavasis. Polynomial time weak approximation algorithms for quadratic programming. In P.M. Pardalos (ed), Complexity in Numerical Optimization. World Scientific, 1993.

    Google Scholar 

  62. J. Warga. A necessary and sufficient condition for a constrained Minimum. SIAM J. Opt. 2(4): 665–667, (1992).

    Article  MathSciNet  MATH  Google Scholar 

  63. Y. Ye and E. Tse. An extension of Karmarkar’s projective algorithm for convex quadratic programming. Mathematical Programming, 44:157–179, (1989).

    Article  MathSciNet  MATH  Google Scholar 

  64. Y. Ye. On the affine scaling algorithm for nonconvex quadratic programming. Mathematical Programming, 56:285–300, 1992.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Facoltà di Economia, Istituto Universitario Navale, Via A. de Gasperi, 5, 80136, Napoli, Italy

    Pasquale L. De Angelis

  2. Dept. of Industrial and System Engineering, University of Florida, Gainesville, FL, 32611, USA

    Panos M. Pardalos

  3. Facoltà di Agraria, Istituto di Idraulica, University of Naples “Federico II” & CPS, Via Cintia, ed. T, 80126, Napoli, Italy

    Gerardo Toraldo

Authors
  1. Pasquale L. De Angelis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Panos M. Pardalos
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gerardo Toraldo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Vienna, Vienna, Austria

    Immanuel M. Bomze

  2. József Attila University, Szeged, Hungary

    Tibor Csendes

  3. University of Trier, Trier, Germany

    Reiner Horst

  4. University of Florida, Gainesville, Florida, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

De Angelis, P.L., Pardalos, P.M., Toraldo, G. (1997). Quadratic Programming with Box Constraints. In: Bomze, I.M., Csendes, T., Horst, R., Pardalos, P.M. (eds) Developments in Global Optimization. Nonconvex Optimization and Its Applications, vol 18. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2600-8_5

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-2600-8_5

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4419-4768-0

  • Online ISBN: 978-1-4757-2600-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation