Pages that link to "Item:Q283932"
From MaRDI portal
The following pages link to Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization (Q283932):
Displaying 7 items.
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems (Q263189) (← links)
- Completely positive reformulations of polynomial optimization problems with linear constraints (Q1679621) (← links)
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization (Q1704915) (← links)
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs (Q2070358) (← links)
- Completely Positive Tensors: Properties, Easily Checkable Subclasses, and Tractable Relaxations (Q2834695) (← links)
- A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems (Q5110556) (← links)
- Further development in convex conic reformulation of geometric nonconvex conic optimization problems (Q6622748) (← links)
