A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
From MaRDI portal
Publication:2010098
Recommendations
- A bounded degree SOS hierarchy for polynomial optimization
- A new approximation hierarchy for polynomial conic optimization
- Convergent conic linear programming relaxations for cone convex polynomial programs
- Alternative SDP and SOCP approximations for polynomial optimization
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
Cites work
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- A Frank--Wolfe type theorem for convex polynomial programs
- A Lagrangian relaxation view of linear and semidefinite hierarchies
- A bounded degree SOS hierarchy for polynomial optimization
- A complete characterization of the gap between convexity and sos-convexity
- A dynamic inequality generation scheme for polynomial programming
- A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure
- Alternative SDP and SOCP approximations for polynomial optimization
- Alternative theorems for quadratic inequality systems and global quadratic optimization
- An accelerated first-order method for solving SOS relaxations of unconstrained polynomial optimization problems
- An easy path to convex analysis and applications
- Anneaux preordonnes
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Convergent conic linear programming relaxations for cone convex polynomial programs
- DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
- Exact conic programming relaxations for a class of convex polynomial cone programs
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- First and second order analysis of nonlinear semidefinite programs
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers
- GloptiPoly 3: moments, optimization and semidefinite programming
- Handbook of test problems in local and global optimization
- Lasserre hierarchy for large scale polynomial optimization in real and complex variables
- Lower bounds for polynomials using geometric programming
- Moments, positive polynomials and their applications
- On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity
- Polynomial matrix inequality and semidefinite representation
- Positive semidefinite diagonal minus tail forms are sums of squares
- Regularization methods for SDP relaxations in large-scale polynomial optimization
- Representation of nonnegative convex polynomials
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets
- Semidefinite programming relaxations for semialgebraic problems
- Semidefinite representation of convex sets
- Sparse-BSOS: a bounded degree SOS hierarchy for large scale polynomial optimization with sparsity
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Sums of squares, moment matrices and optimization over polynomials
Cited in
(17)- A Lagrange multiplier expression method for bilevel polynomial optimization
- Second-order cone programming relaxations for a class of multiobjective convex polynomial problems
- On the construction of converging hierarchies for polynomial optimization based on certificates of global positivity
- Alternative SDP and SOCP approximations for polynomial optimization
- Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity
- On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems
- Convergent conic linear programming relaxations for cone convex polynomial programs
- Robust second order cone conditions and duality for multiobjective problems under uncertainty data
- A note on convex relaxations for the inverse eigenvalue problem
- 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
- Conic linear programming duals for classes of quadratic semi-infinite programs with applications
- A bounded degree SOS hierarchy for polynomial optimization
- A numerical evaluation of the bounded degree sum-of-squares hierarchy of Lasserre, Toh, and Yang on the pooling problem
- Further results on sum-of-squares tensors
- Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules
- Hierarchy relaxations for robust equilibrium constrained polynomial problems and applications to electric vehicle charging scheduling
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)
