Characterizing best approximation from a convex set without convex representation

DOI10.1016/J.JAT.2018.11.003MaRDI QIDQ1717625zbMATH OpenOpenAlexWikidataFDO

Authors V. Jeyakumar, H. Mohebi

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

best approximationHilbert spaceperturbation property

Mathematics Subject Classification ID

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

Cites work

• A Global Approach to Nonlinearly Constrained Best Approximation
• 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
• Best approximation in inner product spaces
• Constraint Qualification, the Strong CHIP, and Best Approximation with Convex Constraints in Banach Spaces
• Fenchel duality and the strong conical hull intersection property
• Fréchet differentiability of convex functions
• Generalizations of Slater's constraint qualification for infinite convex programs
• scientific article; zbMATH DE number 1807400 (Why is no real title available?)
• scientific article; zbMATH DE number 1303653 (Why is no real title available?)
• scientific article; zbMATH DE number 605026 (Why is no real title available?)
• scientific article; zbMATH DE number 3284715 (Why is no real title available?)
• scientific article; zbMATH DE number 3314644 (Why is no real title available?)
• Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
• Necessary and sufficient KKT optimality conditions in non-convex optimization
• Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
• Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming
• On Best Approximation by Nonconvex Sets and Perturbation of Nonconvex Inequality Systems in Hilbert Spaces
• On Extension of Fenchel Duality and its Application
• On representations of the feasible set in convex optimization
• The strong conical hull intersection property for convex programming

Cited in

(10)

• 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
• 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
• A duality-guided proximal splitting method for robust constrained best approximation via convex semi-definite program reformulations
• Robust constrained best approximation in Banach spaces
• Best approximation and optimization
• New qualification conditions for convex optimization without convex representation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1717625)