Pages that link to "Item:Q715094"

The following pages link to A convex polynomial that is not sos-convex (Q715094):

Displaying 26 items.

• Positive semi-definiteness and sum-of-squares property of fourth order four dimensional Hankel tensors (Q268358) (← links)
• Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← links)
• Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995) (← links)
• Three dimensional strongly symmetric circulant tensors (Q492775) (← links)
• Exact conic programming relaxations for a class of convex polynomial cone programs (Q511965) (← links)
• On cones of nonnegative quartic forms (Q525602) (← links)
• Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872) (← links)
• Solving fractional multicriteria optimization problems with sum of squares convex polynomial data (Q1743539) (← links)
• DC decomposition of nonconvex polynomials with algebraic techniques (Q1749445) (← links)
• On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
• Exact SDP relaxations for classes of nonlinear semidefinite programming problems (Q1939707) (← links)
• NP-hardness of deciding convexity of quartic polynomials and related problems (Q1942256) (← links)
• A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials (Q1984696) (← 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)
• Robust SOS-convex polynomial optimization problems: exact SDP relaxations (Q2257075) (← 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)
• On semi-infinite systems of convex polynomial inequalities and polynomial optimization problems (Q2307704) (← links)
• Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations (Q2442635) (← links)
• Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint (Q2663356) (← links)
• Semidefinite Representation of Convex Sets and Convex Hulls (Q2802520) (← links)
• Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems (Q6103695) (← links)
• Characterizing a class of robust vector polynomial optimization via sum of squares conditions (Q6161553) (← links)
• An SDP method for fractional semi-infinite programming problems with SOS-convex polynomials (Q6181366) (← links)
• On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems (Q6200383) (← links)