Stable and total Fenchel duality for composed convex optimization problems

DOI10.1007/s10255-018-0793-3zbMath1402.49030OpenAlexW2895545441MaRDI QIDQ1617041

Xian-Yun Wang, Dong Hui Fang

Publication date: 7 November 2018

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-018-0793-3

zbMATH Keywords

strong dualityconstraint qualificationstotal dualitycomposed convex optimization problem

Mathematics Subject Classification ID

Convex programming (90C25) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Duality theory (optimization) (49N15)

Related Items

New regularity conditions and Fenchel dualities for DC optimization problems involving composite functions, Second-order weakly composed adjacent-generalized contingent epiderivatives and applications to composite set-valued optimization problems, Higher-order generalized tangent epiderivatives and applications to set-valued optimization

Cites Work

• Functional inequalities and theorems of the alternative involving composite functions
• Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
• Best uniform approximation of complex-valued functions by generalized polynomials having restricted ranges
• Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
• Characterizations of \(\varepsilon\)-duality gap statements for composed optimization problems
• The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
• The strong conical hull intersection property for convex programming
• Necessary and sufficient conditions for stable conjugate duality
• The stable Farkas lemma for composite convex functions in infinite dimensional spaces
• Duality in Vector Optimization
• A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces
• Stable and Total Fenchel Duality for Convex Optimization Problems in Locally Convex Spaces
• Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming
• Regularity Conditions via Quasi-Relative Interior in Convex Programming
• Generalized Moreau–Rockafellar results for composed convex functions
• Variational Analysis
• New Sequential Lagrange Multiplier Conditions Characterizing Optimality without Constraint Qualification for Convex Programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item