Article Outline
Keywords
See also
References
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Bomze IM (1992) Copositivity conditions for global optimality in indefinite quadratic programming problems. Czechoslovak J Oper Res 1:7–19
Cohen J, Hickey T (1979) Two algorithms for determining volumes of convex polyhedra. J ACM 26:401–414
Danninger G (1990) A recursive algorithm to detect (strict) copositivity of a symmetric matrix. In: Rieder U, Gessner P, Peyerimhoff A, Radermacher FJ (eds) Operations Research, Proc 14th Symp (Ulm, FRG, 1989), Methods Oper Res., vol 62. Anton Hain Verlag, Bodenheim, pp 45–52
Hall M Jr, Newman M (1963) Copositive and completely positive quadratic forms. Proc Cambridge Philos Soc 59:329–339
Nesterov YE, Nemirovskii AS (1994) Interior point methods in convex programming: Theory and applications. SIAM, Philadelphia
Quist AJ, de Klerk E, Roos C, Terlaky T (1998) Copositive relaxation for general quadratic programming. Optim Methods Softw 9:185–209
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
Bomze, I.M. (2008). Standard Quadratic Optimization Problems: Theory . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_637
Download citation
DOI: https://doi.org/10.1007/978-0-387-74759-0_637
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74758-3
Online ISBN: 978-0-387-74759-0
eBook Packages: Mathematics and StatisticsReference Module Computer Science and Engineering