Pages that link to "Item:Q2257075"

The following pages link to Robust SOS-convex polynomial optimization problems: exact SDP relaxations (Q2257075):

Displaying 32 items.

• Exact conic programming relaxations for a class of convex polynomial cone programs (Q511965) (← links)
• Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872) (← links)
• Characterizing robust local error bounds for linear inequality systems under data uncertainty (Q891541) (← links)
• Robust global error bounds for uncertain linear inequality systems with applications (Q905714) (← links)
• SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization (Q1653325) (← 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)
• On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← 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 conic programming reformulations of two-stage adjustable robust linear programs with new quadratic decision rules (Q1996732) (← links)
• Generalized Farkas lemma with adjustable variables and two-stage robust linear programs (Q2025291) (← links)
• Exact SDP reformulations of adjustable robust linear programs with box uncertainties under separable quadratic decision rules via SOS representations of non-negativity (Q2052413) (← links)
• Robust optimization and data classification for characterization of Huntington disease onset via duality methods (Q2139276) (← links)
• Conic linear programming duals for classes of quadratic semi-infinite programs with applications (Q2156392) (← 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)
• An exact formula for radius of robust feasibility of uncertain linear programs (Q2401515) (← links)
• Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules (Q2677664) (← links)
• Convergence of an SDP hierarchy and optimality of robust convex polynomial optimization problems (Q2678586) (← links)
• (Q4557933) (← links)
• Exact dual semi-definite programs for affinely adjustable robust SOS-convex polynomial optimization problems (Q5045170) (← links)
• On Radius of Robust Feasibility for Convex Conic Programs with Data Uncertainty (Q5069193) (← links)
• Extending the Scope of Robust Quadratic Optimization (Q5084646) (← links)
• Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs (Q5376453) (← 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)
• Characterizing a class of robust vector polynomial optimization via sum of squares conditions (Q6161553) (← links)
• On semidefinite programming relaxations for a class of robust SOS-convex polynomial optimization problems (Q6200383) (← links)
• Energy management strategy based on convex optimization for fuel cell/battery/ultracapacitor hybrid vehicle (Q6495572) (← links)
• Affinely adjustable robust optimization for radiation therapy under evolving data uncertainty via semi-definite programming (Q6548322) (← links)