Farkas-type results for inequality systems with composed convex functions via conjugate duality

DOI10.1016/j.jmaa.2005.09.007zbMath1104.90054OpenAlexW2011840608MaRDI QIDQ2497401

Radu Ioan Boţ, Ioan Bogdan Hodrea, Gert Wanka

Publication date: 4 August 2006

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2005.09.007

zbMATH Keywords

conjugate functionsconjugate dualityFarkas-type resultscomposed convex functions

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46)

Related Items

The stable duality of DC programs for composite convex functions ⋮ Farkas-type results for fractional programming problems ⋮ A perturbation approach to vector optimization problems: Lagrange and Fenchel-Lagrange duality ⋮ Fenchel-Lagrange duality for DC infinite programs with inequality constraints ⋮ A note on the K-epigraph ⋮ Duality and Farkas-type results for extended Ky Fan inequalities with DC functions ⋮ A Fenchel-Lagrange duality approach for a bilevel programming problem with extremal-value function ⋮ The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions ⋮ Farkas' lemma: three decades of generalizations for mathematical optimization ⋮ \(\varepsilon\)-optimality conditions for composed convex optimization problems ⋮ Optimality conditions for weak efficiency to vector optimization problems with composed convex functions ⋮ New constraint qualification and conjugate duality for composed convex optimization problems ⋮ Characterizations of \(\varepsilon\)-duality gap statements for composed optimization problems ⋮ Duality and Farkas-type results for DC fractional programming with DC constraints ⋮ The stable Farkas lemma for composite convex functions in infinite dimensional spaces ⋮ Some Farkas-type results for fractional programming problems with DC functions ⋮ A new approach to strong duality for composite vector optimization problems ⋮ High-Order Optimization Methods for Fully Composite Problems ⋮ A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong duality for generalized convex optimization problems
• First and second-order optimality conditions for convex composite multiobjective optimization
• New formulas for the Legendre-Fenchel transform.
• Convex composite minimization with \(C^{1,1}\) functions
• New constraint qualification and conjugate duality for composed convex optimization problems
• Composite Nonsmooth Programming with Gâteaux Differentiability
• Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
• Farkas-Type Results With Conjugate Functions