Pages that link to "Item:Q462995"

The following pages link to Dual semidefinite programs without duality gaps for a class of convex minimax programs (Q462995):

Displaying 8 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)
• Characterizing robust solution sets of convex programs under data uncertainty (Q2260682) (← links)