Algorithm 996
From MaRDI portal
Publication:4960955
DOI10.1145/3309988zbMath1486.65065arXiv1804.00761OpenAlexW2964648808WikidataQ113310022 ScholiaQ113310022MaRDI QIDQ4960955
Sunyoung Kim, Kim-Chuan Toh, Kojima, Masakazu, Akiko Takeda, N. Ito
Publication date: 24 April 2020
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1804.00761
efficiencysparsitytight lower boundsMatlab software packagebisection and projection methodsbox and complementarity constraintshierarchy of doubly nonnegative relaxationshigh-degree polynomial optimization problems with binary
Related Items (9)
Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints ⋮ Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures ⋮ A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems ⋮ A regularization-patching dual quaternion optimization method for solving the hand-eye calibration problem ⋮ ADMM for the SDP relaxation of the QAP ⋮ Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation ⋮ BBCPOP ⋮ A Newton-bracketing method for a simple conic optimization problem ⋮ Exact SDP relaxations of quadratically constrained quadratic programs with forest structures
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- 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
- Some applications of polynomial optimization in operations research and real-time decision making
- An adaptive accelerated first-order method for convex optimization
- Moreau's decomposition in Banach spaces
- 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
- Handbook on semidefinite, conic and polynomial optimization
- Copositive and semidefinite relaxations of the quadratic assignment problem
- Semidefinite programming relaxations for the quadratic assignment problem
- Semidefinite programming relaxations for semialgebraic problems
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- ADMM for the SDP relaxation of the QAP
- Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
- Adaptive restart for accelerated gradient schemes
- Greedy approximations for minimum submodular cover with submodular cost
- A bounded degree SOS hierarchy for polynomial optimization
- On Lagrangian Relaxation of Quadratic Matrix Constraints
- 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
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Submodular Function Minimization under Covering Constraints
- A Copositive Programming Approach to Graph Partitioning
- GloptiPoly
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convergent SDP‐Relaxations in Polynomial Optimization with Sparsity
This page was built for publication: Algorithm 996
