Pages that link to "Item:Q320868"

The following pages link to Constraint qualifications in convex vector semi-infinite optimization (Q320868):

Displaying 11 items.

• New qualification conditions for convex optimization without convex representation (Q828724) (← links)
• Recent contributions to linear semi-infinite optimization (Q1680760) (← links)
• Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation (Q1681319) (← links)
• Recent contributions to linear semi-infinite optimization: an update (Q1730534) (← links)
• Guaranteeing highly robust weakly efficient solutions for uncertain multi-objective convex programs (Q1754722) (← links)
• Karush-Kuhn-Tucker optimality conditions and duality for convex semi-infinite programming with multiple interval-valued objective functions (Q2053269) (← links)
• Optimality and duality in nonsmooth semi-infinite optimization, using a weak constraint qualification (Q2105868) (← links)
• A standard branch-and-bound approach for nonlinear semi-infinite problems (Q2282532) (← links)
• Optimality conditions in convex multiobjective SIP (Q2364489) (← links)
• Strong Karush-Kuhn-Tucker optimality conditions for Borwein properly efficient solutions of multiobjective semi-infinite programming (Q2660142) (← links)
• <i>ϵ</i>-Efficient solutions in semi-infinite multiobjective optimization (Q4634336) (← links)