Pages that link to "Item:Q2370031"

The following pages link to Fenchel-Lagrange duality versus geometric duality in convex optimization (Q2370031):

Displaying 11 items.

• Constraint qualifications in convex vector semi-infinite optimization (Q320868) (← links)
• Optimal value bounds in nonlinear programming with interval data (Q636005) (← links)
• Optimality conditions for various efficient solutions involving coderivatives: from set-valued optimization problems to set-valued equilibrium problems (Q654070) (← links)
• Farkas-type results for max-functions and applications (Q865005) (← links)
• Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme (Q1706407) (← links)
• On the differentiability of the support function (Q2434634) (← links)
• A general approach for studying duality in multiobjective optimization (Q2460035) (← links)
• New constraint qualification and conjugate duality for composed convex optimization problems (Q2465467) (← links)
• An alternative formulation for a new closed cone constraint qualification (Q2492444) (← links)
• A comparison of alternative c-conjugate dual problems in infinite convex optimization (Q5277962) (← links)
• Necessary optimality conditions for vector reverse convex minimization problems via a conjugate duality (Q6189128) (← links)