Pages that link to "Item:Q5175328"

The following pages link to A new class of alternative theorems for SOS-convex inequalities and robust optimization (Q5175328):

Displaying 17 items.

• Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization (Q280088) (← links)
• Semidefinite programming relaxation methods for global optimization problems with sparse polynomials and unbounded semialgebraic feasible sets (Q288220) (← links)
• Farkas' lemma: three decades of generalizations for mathematical optimization (Q458935) (← 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)
• Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization (Q1728358) (← 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)
• 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)
• 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)
• DC approach to weakly convex optimization and nonconvex quadratic optimization problems (Q4639126) (← links)
• Further results on sum-of-squares tensors (Q5038186) (← links)
• Sum-of-squares relaxations in robust DC optimization and feature selection (Q6142071) (← links)