On standard quadratic programs with exact and inexact doubly nonnegative relaxations
On standard quadratic programs with exact and inexact doubly nonnegative relaxations
About this item
Full title
Author / Creator
Publisher
Berlin/Heidelberg: Springer Berlin Heidelberg
Journal title
Language
English
Formats
Publication information
Publisher
Berlin/Heidelberg: Springer Berlin Heidelberg
Subjects
More information
Scope and Contents
Contents
The problem of minimizing a (nonconvex) quadratic form over the unit simplex, referred to as a standard quadratic program, admits an exact convex conic formulation over the computationally intractable cone of completely positive matrices. Replacing the intractable cone in this formulation by the larger but tractable cone of doubly nonnegative matri...
Alternative Titles
Full title
On standard quadratic programs with exact and inexact doubly nonnegative relaxations
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_2655135141
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_2655135141
Other Identifiers
ISSN
0025-5610
E-ISSN
1436-4646
DOI
10.1007/s10107-020-01611-0