Pages that link to "Item:Q1728215"
From MaRDI portal
The following pages link to Convergent conic linear programming relaxations for cone convex polynomial programs (Q1728215):
Displaying 14 items.
- A cone constrained convex program: structure and algorithms (Q384210) (← links)
- Exact conic programming relaxations for a class of convex polynomial cone programs (Q511965) (← links)
- Linear optimization with cones of moments and nonnegative polynomials (Q745685) (← links)
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness (Q1667169) (← links)
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications (Q1740163) (← links)
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers (Q1756794) (← links)
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs (Q2010098) (← links)
- Two optimal value functions in parametric conic linear programming (Q2139272) (← links)
- Conic linear programming duals for classes of quadratic semi-infinite programs with applications (Q2156392) (← links)
- A new approximation hierarchy for polynomial conic optimization (Q2419540) (← links)
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets (Q4509736) (← links)
- Polynomial Programming: LP-Relaxations Also Converge (Q5317502) (← links)
- Strong duality and solution existence under minimal assumptions in conic linear programming (Q6644232) (← links)
- Refinements and extensions of some strong duality theorems in conic linear programming (Q6650711) (← links)
