Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Struc...
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
About this item
Full title
Author / Creator
Publisher
Philadelphia: Society for Industrial and Applied Mathematics
Journal title
Language
English
Formats
Publication information
Publisher
Philadelphia: Society for Industrial and Applied Mathematics
Subjects
More information
Scope and Contents
Contents
Unconstrained and inequality constrained sparse polynomial optimization problems (POPs) are considered. A correlative sparsity pattern graph is defined to find a certain sparse structure in the objective and constraint polynomials of a POP. Based on this graph, sets of the supports for sums of squares (SOS) polynomials that lead to efficient SOS an...
Alternative Titles
Full title
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_920354732
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_920354732
Other Identifiers
ISSN
1052-6234
E-ISSN
1095-7189
DOI
10.1137/050623802
