Skip to main content
SpringerLink
Log in

Quadratic Programming with Bound Constraints

  • Reference work entry
Encyclopedia of Optimization

Article Outline

Keywords

Synonyms

Problem Statement

Optimality Conditions

  Local Optimality Conditions

  Global Optimality Conditions

Algorithms for Local Minimization

Algorithms for Global Minimization

See also

References

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 2,500.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 2,499.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

References

  1. Benson HH (1995) Concave minimization: Theory, applications and algorithms. In: Horst R, Pardalos PM (eds) Handbook Global Optim. Kluwer, Dordrecht, pp 43–142

    Google Scholar 

  2. Bomze IM, Danninger G (1993) A global optimization algorithm for concave quadratic problems. SIAM J Optim 3:826–842

    Article  MATH  MathSciNet  Google Scholar 

  3. Bomze IM, Danninger G (1994) A finite algorithm for solving general quadratic problems. J Global Optim 4:1–16

    Article  MATH  MathSciNet  Google Scholar 

  4. Coleman TF, Hulbert LA (1989) A direct active set algorithm for large sparse quadratic programs with simple bounds. Math Program 45:373–406

    Article  MATH  MathSciNet  Google Scholar 

  5. Coleman TF, Hulbert LA (1993) A globally and superlinearly convergent algorithm for convex quadratic programs with simple bounds. SIAM J Optim 3:298–321

    Article  MATH  MathSciNet  Google Scholar 

  6. Facchinei F, Lucidi S (1992) A class of penalty functions for optimization problems with bound constraints. Optim 26:239, 259

    Article  MATH  MathSciNet  Google Scholar 

  7. Fletcher R, Jackson MP (1974) Minimization of a quadratic function of many variables subject only to lower and upper bounds. J Inst Math Appl 14:159–174

    Article  MATH  MathSciNet  Google Scholar 

  8. Floudas CA, Visweswaran V (1995) Quadratic optimization. In: Horst R, Pardalos PM (eds) Handbook Global Optim. Kluwer, Dordrecht, pp 217–270

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  10. Gill PE, Murray W, Saunders MA, Wright MH (1991) Inertia- controlling methods for general quadratic programming. SIAM Rev 33(1):1–36

    Article  MATH  MathSciNet  Google Scholar 

  11. Han CG, Pardalos PM, Ye Y (1992) On the solution of indefinite quadratic problems using an interior point algorithm. Informatica 3(4):474–496

    MATH  MathSciNet  Google Scholar 

  12. Han CG, Pardalos PM, Ye Y (1990) Computational aspects of an interior point algorithm for quadratic programming problems with box constraints. SIAM, pp 92–112

    Google Scholar 

  13. Hansen P, Jaumard B, Ruiz M, Xiong J (1993) Global minimization of indefinite quadratic functions subject to box constraints. Naval Res Logist 40:373–392

    Article  MATH  MathSciNet  Google Scholar 

  14. Hiriart-Urruty JB (1995) Conditions for global optimality. In: Horst R, Pardalos PM (eds) Handbook Global Optim. Kluwer, Dordrecht, pp 1–26

    Google Scholar 

  15. Johnson DS, Papadimitriou CH, Yannakakis M (1988) How easy is local search? J Comput Syst Sci 37:79–100

    Article  MATH  MathSciNet  Google Scholar 

  16. Kozlov MK, Tarasov SP, Khachian LG (1979) Polynomial solvability of convex quadratic programming. S-Dokl 20:1108–1111

    MATH  Google Scholar 

  17. Manas M (1968) An algorithm for a nonconvex programming problem. Econ Math Obzor Acad Nacl Ceskoslov 4:202–212

    MathSciNet  Google Scholar 

  18. Moré JJ, Toraldo G (1989) Algorithms for bound constrained quadratic programming problems. Numer Math 55:377–400

    Article  MATH  MathSciNet  Google Scholar 

  19. Moré JJ, Toraldo G (1991) On the solution of large quadratic programming problems with bound constraints. SIAM J Optim 1:93–113

    Article  MATH  MathSciNet  Google Scholar 

  20. Murty KG, Kabadi SN (1987) Some NP-complete problems in quadratic and nonlinear programming. Math Program 39:117–129

    Article  MATH  MathSciNet  Google Scholar 

  21. Neumaier A (1996) Second-order sufficient optimality conditions for local and global nonlinear programming. J Global Optim 9:141–151

    Article  MATH  MathSciNet  Google Scholar 

  22. Pardalos PM (1990) Polynomial time algorithms for some classes of constrained non-convex quadratic problems. Optim 21:843–853

    Article  MATH  MathSciNet  Google Scholar 

  23. Pardalos PM (1991) Global optimisation algorithms for linearly constrained indefinite quadratic problems. Comput Math Appl 21:87–97

    Article  MATH  MathSciNet  Google Scholar 

  24. Pardalos PM, Glick JH, Rosen JB (1987) Global minimization of indefinite quadratic Problems. Computing 39:281–291

    Article  MATH  MathSciNet  Google Scholar 

  25. Pardalos PM, Rosen JB (1986) Methods for global concave minimization: A bibliographic survey. SIAM Rev 28:367–379

    Article  MATH  MathSciNet  Google Scholar 

  26. Pardalos PM, Rosen JB (1987) Constrained global optimization: Algorithms and applications. Lecture Notes Computer Sci, vol 268. Springer, Berlin

    MATH  Google Scholar 

  27. Pardalos PM, Schnitger G (1988) Checking local optimality in constrained quadratic programming is NP-hard. Oper Res Lett 7(1):33–35

    Article  MATH  MathSciNet  Google Scholar 

  28. Phillips AT, Rosen JB (1990) A parallel algorithm for partially separable non-convex global minimization: Linear constraints. Ann Oper Res 25:101–118

    Article  MATH  MathSciNet  Google Scholar 

  29. Poljak BT (1969) The conjugate gradient method in extremal problems. USSR Comput Math Math Phys 9:94–112

    Article  Google Scholar 

  30. Rosen JB (1983) Global minimization of a linearly constrained concave function by partition of feasible domain. Math Oper Res 8:215–230

    MATH  MathSciNet  Google Scholar 

  31. Sherali HD, Tuncbilek CH (1995) A reformulation-convexification approach for solving nonconvex quadratic programming problems. J Global Optim 7:1–31

    Article  MATH  MathSciNet  Google Scholar 

  32. Vavasis SA (1991) Nonlinear optimization: Complexity issues. Oxford Univ. Press, Oxford

    MATH  Google Scholar 

  33. Vavasis SA (1993) Polynomial time weak approximation algorithms for quadratic programming. In: Pardalos PM (ed) Complexity in Numerical Optimization. World Sci., Singapore

    Google Scholar 

  34. Wright S (1993) A path following infeasible-interior point algorithm for linear complementarity problems. Optim Methods Softw 2:79–106

    Article  Google Scholar 

  35. Yang EK, Tolle JW (1991) A class of methods for solving large convex programs subject to box constraints. Math Program 51:223–228

    Article  MATH  MathSciNet  Google Scholar 

  36. Ye Y, Tse E (1989) An extension of Karmarkar's projective algorithm for convex quadratic programming. Math Program 44:157–179

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Naval Institute, Naples, Italy

    Pasquale L. De Angelis

  2. University Naples ‘Federico II’ and CPS, Naples, Italy

    Gerardo Toraldo

Authors
  1. Pasquale L. De Angelis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gerardo Toraldo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Chemical Engineering, Princeton University, Princeton, NJ, 08544-5263, USA

    Christodoulos A. Floudas

  2. Center for Applied Optimization, Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611-6595, USA

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag

About this entry

Cite this entry

De Angelis, P.L., Toraldo, G. (2008). Quadratic Programming with Bound Constraints . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_538

Download citation

Publish with us

Policies and ethics

Search

Navigation