Completely positive reformulations of polynomial optimization problems with linear constraints
From MaRDI portal
Publication:1679621
DOI10.1007/s11590-017-1123-zzbMath1408.90246OpenAlexW2594479200MaRDI QIDQ1679621
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
Related Items (2)
Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems ⋮ HIGH-ORDER COPOSITIVE TENSORS AND ITS APPLICATIONS
Cites Work
- Unnamed Item
- Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization
- On conic QPCCs, conic QCQPs and completely positive programs
- Copositive optimization -- recent developments and applications
- Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization
- Representing quadratically constrained quadratic programs as generalized copositive programs
- Moments and sums of squares for polynomial optimization and related problems
- Quadratic programming with one negative eigenvalue is NP-hard
- Linear operators and positive semidefiniteness of symmetric tensor spaces
- Completely positive reformulations for polynomial optimization
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Global Optimization with Polynomials and the Problem of Moments
- Copositive Programming
- Symmetric Tensor Approximation Hierarchies for the Completely Positive Cone
- Maximum Block Improvement and Polynomial Optimization
- Variational Analysis
- Nonnegative Tensor Factorization, Completely Positive Tensors, and a Hierarchical Elimination Algorithm
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
This page was built for publication: Completely positive reformulations of polynomial optimization problems with linear constraints
