A bounded degree SOS hierarchy for polynomial optimization
From MaRDI portal
Publication:2397758
DOI10.1007/s13675-015-0050-yzbMath1368.90132arXiv1501.06126OpenAlexW1822269556MaRDI QIDQ2397758
Shouguang Yang, Kim-Chuan Toh, Jean-Bernard Lasserre
Publication date: 23 May 2017
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1501.06126
Related Items
Signomial and polynomial optimization via relative entropy and partial dualization, On the tightness of semidefinite relaxations for rotation estimation, Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints, Sparse noncommutative polynomial optimization, Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity, A new approximation hierarchy for polynomial conic optimization, A hierarchy of spectral relaxations for polynomial optimization, Moment Problem and Its Applications to Risk Assessment, Computing the Hausdorff Boundary Measure of Semialgebraic Sets, DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization, A multilevel analysis of the Lasserre hierarchy, TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity, Chordal-TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity with Chordal Extension, Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables, LP Formulations for Polynomial Optimization Problems, A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization, A new algorithm for concave quadratic programming, A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs, Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations, Alternative SDP and SOCP approximations for polynomial optimization, Algorithm 996, Positive Maps and Separable Matrices, Solving sparse polynomial optimization problems with chordal structure using the sparse bounded-degree sum-of-squares hierarchy, A sublevel moment-SOS hierarchy for polynomial optimization, Finding unstable periodic orbits: a hybrid approach with polynomial optimization, Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space, Tight relaxations for polynomial optimization and Lagrange multiplier expressions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Optimality conditions and finite convergence of Lasserre's hierarchy
- Semidefinite representation of convex sets
- A collection of test problems for constrained global optimization algorithms
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Anneaux preordonnes
- A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
- Global Optimization with Polynomials and the Problem of Moments
- Convex Relaxations and Integrality Gaps
- A Lagrangian Relaxation View of Linear and Semidefinite Hierarchies
- On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- GloptiPoly 3: moments, optimization and semidefinite programming
- Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain
- Representations of Non-Negative Polynomials, Degree Bounds and Applications to Optimization
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- The truncated complex $K$-moment problem
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Semidefinite Programming vs. LP Relaxations for Polynomial Programming
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
