Fenchel duality and the strong conical hull intersection property

DOI10.1023/A:1022658308898zbMath0955.90148OpenAlexW1505546553MaRDI QIDQ1807691

Wu Li, John J. Swetits, Frank Deutsch

Publication date: 4 March 2001

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022658308898

zbMATH Keywords

convex optimizationFenchel dualitystrong conical hull intersection propertybest approximation in Hilbert space

Mathematics Subject Classification ID

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

Related Items (20)

New qualification conditions for convex optimization without convex representation ⋮ On basic constraint qualifications for infinite system of convex Inequalities in Banach spaces ⋮ Characterizing nonconvex constrained best approximation using Robinson's constraint qualification ⋮ Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation ⋮ Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty ⋮ Fenchel duality in infinite-dimensional setting and its applications. ⋮ Characterizing best approximation from a convex set without convex representation ⋮ Strong CHIP for infinite systems of convex sets in normed linear spaces ⋮ A note on strong duality in convex semidefinite optimization: necessary and sufficient conditions ⋮ Revisiting some rules of convex analysis ⋮ Strong Abadie CQ, ACQ, calmness and linear regularity ⋮ The strong conical hull intersection property for convex programming ⋮ A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces. ⋮ Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets ⋮ Robust constrained best approximation with nonconvex constraints ⋮ Strong CHIP, normality, and linear regularity of convex sets ⋮ A Global Approach to Nonlinearly Constrained Best Approximation ⋮ Proof of a conjecture by Deutsch, Li, and Swetits on duality of optimization problems ⋮ The FM and BCQ Qualifications for Inequality Systems of Convex Functions in Normed Linear Spaces ⋮ Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation

Cites Work

• A cyclic projection algorithm via duality
• A dual approach to constrained interpolation from a convex subset of Hilbert space
• Two generalizations of Dykstra's cyclic projections algorithm
• Strong conical hull intersection property, bounded linear regularity, Jameson's property \((G)\), and error bounds in convex optimization
• Constrained best approximation in Hilbert space
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fenchel duality and the strong conical hull intersection property