Characterizing best approximation from a convex set without convex representation

DOI10.1016/J.JAT.2018.11.003zbMath1407.41012OpenAlexW2903642613WikidataQ128749341 ScholiaQ128749341MaRDI QIDQ1717625

Hossein Mohebi, Vaithilingam Jeyakumar

Publication date: 7 February 2019

Published in: Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jat.2018.11.003

zbMATH Keywords

Hilbert spacebest approximationperturbation property

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Approximation with constraints (41A29)

Related Items (7)

New qualification conditions for convex optimization without convex representation ⋮ Lagrange multiplier characterizations of constrained best approximation with nonsmooth nonconvex constraints ⋮ Characterizations of the solution set for tangentially convex optimization problems ⋮ Best approximation with geometric constraints ⋮ Robust constrained best approximation with nonconvex constraints ⋮ Lagrange multiplier characterizations of constrained best approximation with infinite constraints ⋮ Optimality conditions for nonconvex problems over nearly convex feasible sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On representations of the feasible set in convex optimization
• Generalizations of Slater's constraint qualification for infinite convex programs
• Fenchel duality and the strong conical hull intersection property
• Necessary and sufficient KKT optimality conditions in non-convex optimization
• The strong conical hull intersection property for convex programming
• Fréchet differentiability of convex functions
• Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
• On Extension of Fenchel Duality and its Application
• Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
• Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
• On Best Approximation by Nonconvex Sets and Perturbation of Nonconvex Inequality Systems in Hilbert Spaces
• Best Approximation from the Intersection of a Closed Convex Set and a Polyhedron in Hilbert Space, Weak Slater Conditions, and the Strong Conical Hull Intersection Property
• Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
• A Global Approach to Nonlinearly Constrained Best Approximation
• Best approximation in inner product spaces

This page was built for publication: Characterizing best approximation from a convex set without convex representation