Completely positive reformulations for polynomial optimization
From MaRDI portal
Publication:2349130
DOI10.1007/s10107-014-0822-9zbMath1328.90114OpenAlexW2107427171MaRDI QIDQ2349130
Luis F. Zuluaga, Juan Carlos Vera, Javier F. Peña
Publication date: 19 June 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-014-0822-9
Related Items (33)
Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization ⋮ Completely positive tensor recovery with minimal nuclear value ⋮ Copositivity detection of tensors: theory and algorithm ⋮ An exact completely positive programming formulation for the discrete ordered median problem: an extended version ⋮ Completely positive reformulations of polynomial optimization problems with linear constraints ⋮ Completely Positive Binary Tensors ⋮ Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems ⋮ Approximation hierarchies for copositive cone over symmetric cone and their comparison ⋮ A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems ⋮ Hermitian completely positive matrices ⋮ Completely positive tensors in the complex field ⋮ Copositive tensor optimization problem and its applications to hypergraphs ⋮ Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization ⋮ Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017 ⋮ HIGH-ORDER COPOSITIVE TENSORS AND ITS APPLICATIONS ⋮ Geometry of the Copositive Tensor Cone and its Dual ⋮ Hypergraph characterizations of copositive tensors ⋮ \(\{0,1\}\) completely positive tensors and multi-hypergraphs ⋮ A semidefinite algorithm for completely positive tensor decomposition ⋮ Copositive tensor detection and its applications in physics and hypergraphs ⋮ Structured rectangular tensors and rectangular tensor complementarity problems ⋮ An SDP method for copositivity of partially symmetric tensors ⋮ A hierarchy of semidefinite relaxations for completely positive tensor optimization problems ⋮ A Complete Semidefinite Algorithm for Detecting Copositive Matrices and Tensors ⋮ On \(\{0,1\}\) CP tensors and CP pseudographs ⋮ Best Nonnegative Rank-One Approximations of Tensors ⋮ On copositiveness identification of partially symmetric rectangular tensors ⋮ Unnamed Item ⋮ Test of copositive tensors ⋮ An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs ⋮ Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations ⋮ The Discrete Moment Problem with Nonconvex Shape Constraints ⋮ Exploiting symmetry in copositive programs via semidefinite hierarchies
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- On conic QPCCs, conic QCQPs and completely positive programs
- Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
- Copositivity and constrained fractional quadratic problems
- Representing quadratically constrained quadratic programs as generalized copositive programs
- Quadratic factorization heuristics for copositive programming
- Handbook on semidefinite, conic and polynomial optimization
- Faster, but weaker, relaxations for quadratically constrained quadratic programs
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Sum of squares method for sensor network localization
- Copositive programming motivated bounds on the stability and the chromatic numbers
- The \(K\)-moment problem for compact semi-algebraic sets
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- Bounds on measures satisfying moment conditions.
- Separating doubly nonnegative and completely positive matrices
- A note on Burer's copositive representation of mixed-binary QPs
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Approximation of the joint spectral radius using sum of squares
- A PTAS for the minimization of polynomials of fixed degree over the simplex
- Global Optimization with Polynomials and the Problem of Moments
- An Explicit Equivalent Positive Semidefinite Program for Nonlinear 0-1 Programs
- Approximation of the Stability Number of a Graph via Copositive Programming
- Symmetric Tensor Approximation Hierarchies for the Completely Positive Cone
- Theta Bodies for Polynomial Ideals
- Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
- Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials
- The Operator $\Psi$ for the Chromatic Number of a Graph
- On the Relation Between Option and Stock Prices: A Convex Optimization Approach
- Class of global minimum bounds of polynomial functions
- A comparison of the Delsarte and Lovász bounds
- On the Shannon capacity of a graph
- Variational Analysis
- Optimization Problems over Positive Pseudopolynomial Matrices
- Semidefinite Optimization and Convex Algebraic Geometry
- Analysis of Polynomial Systems With Time Delays via the Sum of Squares Decomposition
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
- Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
- A Copositive Programming Approach to Graph Partitioning
- LMI Approximations for Cones of Positive Semidefinite Forms
- Convex Analysis
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope
- On copositive programming and standard quadratic optimization problems
- An algorithmic approach to Schmüdgen's Positivstellensatz
This page was built for publication: Completely positive reformulations for polynomial optimization
