Pages that link to "Item:Q462995"
From MaRDI portal
The following pages link to Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995):
Displaying 17 items.
- Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization (Q280088) (← links)
- Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← 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)
- Solving fractional multicriteria optimization problems with sum of squares convex polynomial data (Q1743539) (← links)
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers (Q1756794) (← links)
- Generalized Farkas lemma with adjustable variables and two-stage robust linear programs (Q2025291) (← 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 robust global optimal values of bilevel polynomial programs with uncertain linear constraints (Q2363578) (← links)
- (Q4557933) (← links)
- Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs (Q5376453) (← links)
- On duality gap with polynomial multipliers for polynomial optimization problems (Q5879569) (← 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)
