Pages that link to "Item:Q4446317"
From MaRDI portal
The following pages link to A GENERAL FRAMEWORK FOR CONVEX RELAXATION OF POLYNOMIAL OPTIMIZATION PROBLEMS OVER CONES (Q4446317):
Displaying 10 items.
- Exact computable representation of some second-order cone constrained quadratic programming problems (Q384217) (← links)
- Necessary optimality conditions and new optimization methods for cubic polynomial optimization problems with mixed variables (Q430937) (← links)
- Global optimality conditions and optimization methods for polynomial programming problems (Q496629) (← links)
- A polynomial optimization approach to constant rebalanced portfolio selection (Q694522) (← links)
- An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones (Q879967) (← links)
- Sparsity in sums of squares of polynomials (Q1777218) (← links)
- Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization (Q1949261) (← links)
- A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
- Persistence in discrete optimization under data uncertainty (Q2502201) (← links)
- Equivalence of sum of squares convex relaxations for quadratic distance problems (Q2847256) (← links)
