A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
Semidefinite programming relaxations for semialgebraic problems
A dynamic inequality generation scheme for polynomial programming
GloptiPoly 3: moments, optimization and semidefinite programming
Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
Lower bounds for polynomials using geometric programming
DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization
Positive semidefinite diagonal minus tail forms are sums of squares
Handbook of test problems in local and global optimization
A Frank--Wolfe type theorem for convex polynomial programs
Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers
Anneaux preordonnes
Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
First and second order analysis of nonlinear semidefinite programs
A Lagrangian relaxation view of linear and semidefinite hierarchies
Constraint qualifications characterizing Lagrangian duality in convex optimization
Semidefinite representation of convex sets
Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
Convergent conic linear programming relaxations for cone convex polynomial programs
An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems
A complete characterization of the gap between convexity and sos-convexity
Regularization methods for SDP relaxations in large-scale polynomial optimization
Polynomial matrix inequality and semidefinite representation
Exact conic programming relaxations for a class of convex polynomial cone programs
Representation of nonnegative convex polynomials
Lasserre Hierarchy for Large Scale Polynomial Optimization in Real and Complex Variables
A bounded degree SOS hierarchy for polynomial optimization
Alternative SDP and SOCP approximations for polynomial optimization
On the Construction of Converging Hierarchies for Polynomial Optimization Based on Certificates of Global Positivity

Cited In (12)

A note on convex relaxations for the inverse eigenvalue problem
A Lagrange Multiplier Expression Method for Bilevel Polynomial Optimization
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
Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling
On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems
Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity
Robust second order cone conditions and duality for multiobjective problems under uncertainty data
Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules
Further results on sum-of-squares tensors
Unconstrained minimization of block-circulant polynomials via semidefinite program in third-order tensor space
Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems

Uses Software

GloptiPoly
SPOT
SPOTless
Sparse-BSOS

This page was built for publication: A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010098)