Pages that link to "Item:Q2338781"

The following pages link to Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming (Q2338781):

Displaying 16 items.

• Constraint qualifications in convex vector semi-infinite optimization (Q320868) (← links)
• Some characterizations of robust optimal solutions for uncertain convex optimization problems (Q331984) (← links)
• Some dual characterizations of Farkas-type results for fractional programming problems (Q1670547) (← links)
• Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme (Q1706407) (← links)
• A note on optimality conditions for DC programs involving composite functions (Q1722334) (← links)
• Generalized polyhedral convex optimization problems (Q2010093) (← links)
• On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data (Q2067760) (← links)
• Optimality conditions of Fenchel-Lagrange duality and Farkas-type results for composite DC infinite programs (Q2076392) (← links)
• Characterizing robust weak sharp solution sets of convex optimization problems with uncertainty (Q2244235) (← links)
• Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems (Q2261970) (← links)
• Fenchel-Lagrange duality for DC infinite programs with inequality constraints (Q2656086) (← links)
• Optimality conditions for composite DC infinite programming problems (Q2691286) (← links)
• Some characterizations of duality for DC optimization with composite functions (Q4559389) (← links)
• Farkas-Type Theorems and Applications: From IPH Functions to ICR Functions (Q4622796) (← links)
• New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions (Q4986403) (← links)
• A comparison of alternative c-conjugate dual problems in infinite convex optimization (Q5277962) (← links)