Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
From MaRDI portal
Publication:1704915
DOI10.1007/s10898-017-0558-1zbMath1403.90554arXiv1604.06823OpenAlexW3100861724MaRDI QIDQ1704915
Xiaolong Kuang, Luis F. Zuluaga
Publication date: 13 March 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1604.06823
copositive programmingconvex relaxationcompletely positive tensorcompletely positive semidefinite tensor
Related Items (5)
(Global) optimization: historical notes and recent developments ⋮ Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems ⋮ HIGH-ORDER COPOSITIVE TENSORS AND ITS APPLICATIONS ⋮ A hierarchy of semidefinite relaxations for completely positive tensor optimization problems ⋮ Unnamed Item
Uses Software
Cites Work
- Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization
- On conic QPCCs, conic QCQPs and completely positive programs
- Moment approximations for set-semidefinite polynomials
- Representing quadratically constrained quadratic programs as generalized copositive programs
- Handbook on semidefinite, conic and polynomial optimization
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Copositive programming motivated bounds on the stability and the chromatic numbers
- A linear programming reformulation of the standard quadratic optimization problem
- A GRASP for the biquadratic assignment problem
- Semidefinite programming in combinatorial optimization
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Approximating quadratic programming with bound and quadratic constraints
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming
- 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
- Copositive programming via semi-infinite optimization
- 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
- Equivalent Relaxations of Optimal Power Flow
- Solving a class of non-convex quadratic problems based on generalized KKT conditions and neurodynamic optimization technique
- Biquadratic Optimization Over Unit Spheres and Semidefinite Programming Relaxations
- Class of global minimum bounds of polynomial functions
- Semidefinite Programming
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- Second-Order-Cone Constraints for Extended Trust-Region Subproblems
- Blind constant modulus equalization via convex optimization
- Tensor and its tucker core: The invariance relationships
- 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
- Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
- On copositive programming and standard quadratic optimization problems
This page was built for publication: Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
