Pages that link to "Item:Q1939707"

The following pages link to Exact SDP relaxations for classes of nonlinear semidefinite programming problems (Q1939707):

Displaying 22 items.

• Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220) (← links)
• Finding the maximum eigenvalue of essentially nonnegative symmetric tensors via sum of squares programming (Q378284) (← links)
• Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995) (← links)
• Exact conic programming relaxations for a class of convex polynomial cone programs (Q511965) (← links)
• SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization (Q1653325) (← links)
• Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness (Q1667169) (← 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)
• On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
• A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs (Q1785391) (← links)
• Radius of robust feasibility formulas for classes of convex programs with uncertain polynomial constraints (Q1785470) (← links)
• A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials (Q1984696) (← links)
• Exact SDP relaxations of quadratically constrained quadratic programs with forest structures (Q2114577) (← links)
• On solving a class of fractional semi-infinite polynomial programming problems (Q2231044) (← links)
• Characterizing robust solution sets of convex programs under data uncertainty (Q2260682) (← links)
• Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials (Q2279398) (← 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)
• A new class of alternative theorems for SOS-convex inequalities and robust optimization (Q5175328) (← links)
• Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems (Q6103695) (← links)
• Sum-of-squares relaxations in robust DC optimization and feature selection (Q6142071) (← links)
• On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems (Q6200383) (← links)