Pages that link to "Item:Q1667169"
From MaRDI portal
The following pages link to Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness (Q1667169):
Displaying 16 items.
- Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220) (← links)
- On polynomial optimization over non-compact semi-algebraic sets (Q481041) (← links)
- Exact conic programming relaxations for a class of convex polynomial cone programs (Q511965) (← links)
- Convergent conic linear programming relaxations for cone convex polynomial programs (Q1728215) (← links)
- A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems (Q1728251) (← links)
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications (Q1740163) (← links)
- A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs (Q1785391) (← links)
- Multi-objective convex polynomial optimization and semidefinite programming relaxations (Q2038921) (← links)
- On solving a class of fractional semi-infinite polynomial programming problems (Q2231044) (← links)
- Finding robust global optimal values of bilevel polynomial programs with uncertain linear constraints (Q2363578) (← links)
- Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint (Q2663356) (← links)
- Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems (Q2678586) (← links)
- Convergent Semidefinite Programming Relaxations for Global Bilevel Polynomial Optimization Problems (Q2796798) (← links)
- (Q4557933) (← links)
- Coercive Polynomials and Their Newton Polytopes (Q5502243) (← links)
- On duality gap with polynomial multipliers for polynomial optimization problems (Q5879569) (← links)
