Analysis of copositive optimization based linear programming bounds on standard quadratic optimizati...
Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
About this item
Full title
Author / Creator
Publisher
New York: Springer US
Journal title
Language
English
Formats
Publication information
Publisher
New York: Springer US
Subjects
More information
Scope and Contents
Contents
The problem of minimizing a quadratic form over the unit simplex, referred to as a standard quadratic optimization problem, admits an exact reformulation as a linear optimization problem over the convex cone of completely positive matrices. This computationally intractable cone can be approximated in various ways from the inside and from the outsid...
Alternative Titles
Full title
Analysis of copositive optimization based linear programming bounds on standard quadratic optimization
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_miscellaneous_1744684258
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_miscellaneous_1744684258
Other Identifiers
ISSN
0925-5001
E-ISSN
1573-2916
DOI
10.1007/s10898-015-0269-4
