Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
From MaRDI portal
Publication:2144550
Recommendations
- Algorithm 996
- Second-Order Cone Relaxations for Binary Quadratic Polynomial Programs
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
- Application of a facial reduction algorithm and an inexact primal-dual path-following method for doubly nonnegative relaxation for mixed binary nonconvex quadratic optimization problems
Cites work
- A bounded degree SOS hierarchy for polynomial optimization
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
- A robust Lagrangian-DNN method for a class of quadratic optimization problems
- Active set algorithms for isotonic regression; a unifying framework
- Algorithm 996
- Algorithms for a class of isotonic regression problems
- Exploiting sparsity in semidefinite programming via matrix completion. I: General framework
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 3177945 (Why is no real title available?)
- scientific article; zbMATH DE number 554762 (Why is no real title available?)
- scientific article; zbMATH DE number 1757962 (Why is no real title available?)
- Lagrangian-conic relaxations. I: A unified framework and its applications to quadratic optimization problems
- On doubly positive semidefinite programming relaxations
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Regularization methods for SDP relaxations in large-scale polynomial optimization
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- Separating doubly nonnegative and completely positive matrices
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Sums of squares, moment matrices and optimization over polynomials
Cited in
(5)- Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures
- Application of a facial reduction algorithm and an inexact primal-dual path-following method for doubly nonnegative relaxation for mixed binary nonconvex quadratic optimization problems
- Algorithm 996
- A geometrical analysis on convex conic reformulations of quadratic and polynomial optimization problems
- A robust Lagrangian-DNN method for a class of quadratic optimization problems
This page was built for publication: Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144550)
