Completely positive reformulations of polynomial optimization problems with linear constraints

DOI10.1007/S11590-017-1123-ZMaRDI QIDQ1679621zbMATH OpenOpenAlexFDO

Authors Wei Xia, Luis Fernando Zuluaga

Publication date 9 November 2017

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-017-1123-z

zbMATH Keywords

completely positive relaxationscompletely positive tensorspolynomial optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• Completely positive reformulations for polynomial optimization
• Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
• Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization
• A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
• Quadratic optimization over a polyhedral cone

Cites work

• A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
• Completely positive reformulations for polynomial optimization
• Copositive optimization -- recent developments and applications
• Copositive programming
• Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization
• Global optimization with polynomials and the problem of moments
• Linear operators and positive semidefiniteness of symmetric tensor spaces
• Maximum block improvement and polynomial optimization
• Moments and sums of squares for polynomial optimization and related problems
• Nonnegative tensor factorization, completely positive tensors, and a hierarchical elimination algorithm
• On conic QPCCs, conic QCQPs and completely positive programs
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Quadratic programming with one negative eigenvalue is NP-hard
• Representing quadratically constrained quadratic programs as generalized copositive programs
• Sums of squares, moment matrices and optimization over polynomials
• Symmetric tensor approximation hierarchies for the completely positive cone
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
• Variational Analysis

Cited in

(6)

• Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
• Completely positive reformulations for polynomial optimization
• A geometrical analysis on convex conic reformulations of quadratic and polynomial optimization problems
• High-order copositive tensors and its applications
• Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems
• Degree reduction techniques for polynomial optimization problems

This page was built for publication: Completely positive reformulations of polynomial optimization problems with linear constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1679621)