A comparison of alternative c-conjugate dual problems in infinite convex optimization

DOI10.1080/02331934.2017.1295046zbMath1386.90171OpenAlexW2598061374MaRDI QIDQ5277962

No author found.

Publication date: 12 July 2017

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10045/66612

zbMATH Keywords

dual problemsolvabilityoptimal solutiongeneralized convex conjugationFenchel conjugationFenchel-Lagrange dualityinfinite convex optimization

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Programming in abstract spaces (90C48)

Related Items (6)

Set-valued evenly convex functions: characterizations and C-conjugacy ⋮ On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions ⋮ Strong and total duality for constrained composed optimization via a coupling conjugation scheme ⋮ Necessary and sufficient conditions for strong Fenchel-Lagrange duality via a coupling conjugation scheme ⋮ New duality results for evenly convex optimization problems ⋮ \(e^{\prime }\)-convex sets and functions: properties and characterizations

Cites Work

• Unnamed Item
• Lagrange duality for evenly convex optimization problems
• Duality and Farkas-type results for DC infinite programming with inequality constraints
• The e-support function of an e-convex set and conjugacy for e-convex functions
• Duality for minmax programs
• Strong duality for generalized convex optimization problems
• Conjugate duality in convex optimization
• Characterizations of evenly convex sets and evenly quasiconvex functions
• On linear systems containing strict inequalities
• Infimal convolution, \( c \)-subdifferentiability, and Fenchel duality in evenly convex optimization
• Regularity conditions characterizing Fenchel-Lagrange duality and Farkas-type results in DC infinite programming
• Fenchel-Lagrange duality versus geometric duality in convex optimization
• Analyzing linear systems containing strict inequalities via evenly convex hulls
• A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
• Quasiconvex duality theory by generalized conjugation methods

This page was built for publication: A comparison of alternative c-conjugate dual problems in infinite convex optimization