On the relations between different duals assigned to composed optimization problems

DOI10.1007/s00186-007-0169-6zbMath1133.49031OpenAlexW2027366985MaRDI QIDQ2466796

Radu Ioan Boţ, Gert Wanka, Emese Vargyas

Publication date: 16 January 2008

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-007-0169-6

zbMATH Keywords

perturbation theoryconvex programmingconjugate dualitycomposed functions

Mathematics Subject Classification ID

Convex programming (90C25) Convex functions and convex programs in convex geometry (52A41) Duality theory (optimization) (49N15)

Related Items (5)

A Fenchel-Lagrange duality approach for a bilevel programming problem with extremal-value function ⋮ Conjugate duality for multiobjective composed optimization problems ⋮ A duality approach for a class of semivectorial bilevel programming problems ⋮ The stable Farkas lemma for composite convex functions in infinite dimensional spaces ⋮ An Extended Fenchel--Lagrange Duality Approach and Optimality Conditions for Strong Bilevel Programming Problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Convex composite multi-objective nonsmooth programming
• Duality for location problems with unbounded unit balls
• Absolute and monotonic norms
• Second-order global optimality conditions for convex composite optimization
• Convex composite minimization with \(C^{1,1}\) functions
• Composite Nonsmooth Programming with Gâteaux Differentiability
• Convex Analysis

This page was built for publication: On the relations between different duals assigned to composed optimization problems