Robust constrained best approximation in Banach spaces

DOI10.1007/S11228-025-00776-0MaRDI QIDQ6913186zbMATH OpenFDO

Authors S. Salkhordeh, H. Mohebi

Publication date 21 October 2025

Published in Set-Valued and Variational Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11228-025-00776-0

zbMATH Keywords

Lagrange multipliersperturbation propertyrobust constrained best approximationrobust optimizationrobust sharpened nondegeneracystrong conical hull intersection property

Mathematics Subject Classification ID

Approximation with constraints (41A29) Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Semidefinite programming (90C22) Convex programming (90C25)

Cites work

• A dual approach to constrained interpolation from a convex subset of Hilbert space
• A Global Approach to Nonlinearly Constrained Best Approximation
• Best approximation in inner product spaces
• Characterizing best approximation from a convex set without convex representation
• Constrained best approximation in Hilbert space
• Convex analysis and beyond. Volume I. Basic theory
• scientific article; zbMATH DE number 1807400 (Why is no real title available?)
• scientific article; zbMATH DE number 3314644 (Why is no real title available?)
• Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
• Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
• 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
• Robust optimization
• Subdifferentials of nonconvex supremum functions and their applications to semi-infinite and infinite programs with Lipschitzian data
• Theory and applications of robust optimization

Cited in

(1)

• A duality-guided proximal splitting method for robust constrained best approximation via convex semi-definite program reformulations

This page was built for publication: Robust constrained best approximation in Banach spaces

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