Lagrangian-conic relaxations. II: Applications to polynomial optimization problems
From MaRDI portal
Recommendations
- A Lagrangian relaxation view of linear and semidefinite hierarchies
- Lagrangian-conic relaxations. I: A unified framework and its applications to quadratic optimization problems
- A new approximation hierarchy for polynomial conic optimization
- Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
Cited in
(14)- Alternative SDP and SOCP approximations for polynomial optimization
- Tight relaxations for polynomial optimization and Lagrange multiplier expressions
- Lagrangian quadratic bounds in polynomial nonconvex and Boolean models with superfluous constraints
- Completely positive tensors: properties, easily checkable subclasses, and tractable relaxations
- A Lagrangian relaxation view of linear and semidefinite hierarchies
- A Lagrangian Relaxation for Golomb Rulers
- Algorithm 996
- A Newton-bracketing method for a simple conic optimization problem
- A geometrical analysis on convex conic reformulations of quadratic and polynomial optimization problems
- Lagrangian-conic relaxations. I: A unified framework and its applications to quadratic optimization problems
- A robust Lagrangian-DNN method for a class of quadratic optimization problems
- Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems
- A hierarchy of spectral relaxations for polynomial optimization
- Further development in convex conic reformulation of geometric nonconvex conic optimization problems
This page was built for publication: Lagrangian-conic relaxations. II: Applications to polynomial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4963668)
