Some conjugation formulas and subdifferential formulas of convex analysis revisited

DOI10.1016/j.jmaa.2005.03.068zbMath1211.49018OpenAlexW1998048602WikidataQ57836383 ScholiaQ57836383MaRDI QIDQ819646

Ivan Singer, Juan-Enrique Martinez-Legaz

Publication date: 29 March 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.03.068

Mathematics Subject Classification ID

Convex programming (90C25) Nonsmooth analysis (49J52) Variational methods applied to PDEs (35A15) Duality theory (optimization) (49N15)

Related Items

\(\varepsilon\)-optimality conditions for composed convex optimization problems, Fenchel–Moreau conjugation for lower semi-continuous functions

Cites Work

• Duality principles for optimization problems dealing with the difference of vector-valued convex mappings
• Convex analysis and nonlinear optimization. Theory and examples
• A general formula for the horizon function of a convex composite function
• Extension of Fenchel's duality theorem for convex functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item