A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
From MaRDI portal
Publication:2010098
DOI10.1007/s10898-019-00831-9zbMath1433.90122OpenAlexW2975012327WikidataQ127216694 ScholiaQ127216694MaRDI QIDQ2010098
Guoyin Li, Thai Doan Chuong, Vaithilingam Jeyakumar
Publication date: 3 December 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-019-00831-9
global optimizationnonconvex polynomial optimizationcone-convex polynomial programsconic programming relaxationsconvex semi-algebraic programs
Related Items (11)
Further results on sum-of-squares tensors ⋮ Second-order cone programming relaxations for a class of multiobjective convex polynomial problems ⋮ Conic linear programming duals for classes of quadratic semi-infinite programs with applications ⋮ Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules ⋮ Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems ⋮ On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems ⋮ Robust second order cone conditions and duality for multiobjective problems under uncertainty data ⋮ A note on convex relaxations for the inverse eigenvalue problem ⋮ A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization ⋮ Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity ⋮ Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dynamic inequality generation scheme for polynomial programming
- A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
- Exact conic programming relaxations for a class of convex polynomial cone programs
- Positive semidefinite diagonal minus tail forms are sums of squares
- Semidefinite representation of convex sets
- Representation of nonnegative convex polynomials
- Handbook of test problems in local and global optimization
- First and second order analysis of nonlinear semidefinite programs
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Semidefinite programming relaxations for semialgebraic problems
- A Frank--Wolfe type theorem for convex polynomial programs
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- Convergent conic linear programming relaxations for cone convex polynomial programs
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Alternative SDP and SOCP approximations for polynomial optimization
- Anneaux preordonnes
- A bounded degree SOS hierarchy for polynomial optimization
- A Complete Characterization of the Gap between Convexity and SOS-Convexity
- A Lagrangian Relaxation View of Linear and Semidefinite Hierarchies
- Polynomial Matrix Inequality and Semidefinite Representation
- Regularization Methods for SDP Relaxations in Large-Scale Polynomial Optimization
- Lower Bounds for Polynomials Using Geometric Programming
- GloptiPoly 3: moments, optimization and semidefinite programming
- Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
- Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables
- On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity
- An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems
- DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
This page was built for publication: A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
