Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
From MaRDI portal
Publication:2144550
DOI10.1007/s10107-020-01594-yzbMath1494.90071OpenAlexW3107186052MaRDI QIDQ2144550
Kim-Chuan Toh, Sunyoung Kim, Kojima, Masakazu
Publication date: 14 June 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-020-01594-y
doubly nonnegative relaxationsa class of polyhedral conescomputational efficiency and tight boundspolynomial optimization problems with nonnegative variablesthe bisection and projection algorithm
Convex programming (90C25) Nonconvex programming, global optimization (90C26) Polynomial optimization (90C23)
Related Items
A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems, Algorithm 996
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- A robust Lagrangian-DNN method for a class of quadratic optimization problems
- Active set algorithms for isotonic regression; a unifying framework
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Algorithms for a class of isotonic regression problems
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
- Separating doubly nonnegative and completely positive matrices
- A bounded degree SOS hierarchy for polynomial optimization
- Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework
- Global Optimization with Polynomials and the Problem of Moments
- Regularization Methods for SDP Relaxations in Large-Scale Polynomial Optimization
- On Doubly Positive Semidefinite Programming Relaxations
- Algorithm 996
- A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
