Best approximation with geometric constraints

DOI10.1007/S40065-023-00446-9MaRDI QIDQ6192591zbMATH OpenOpenAlexFDO

Authors H. Mohebi, Hassan Bakhtiari

Publication date 11 March 2024

Published in Arabian Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s40065-023-00446-9

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Nonconvex programming, global optimization (90C26) Best approximation, Chebyshev systems (41A50) Semi-infinite programming (90C34) Approximation with constraints (41A29)

Recommendations

• Lagrange multiplier characterizations of constrained best approximation with infinite constraints
• Characterizing nonconvex constrained best approximation using Robinson's constraint qualification
• A Global Approach to Nonlinearly Constrained Best Approximation
• Robust constrained best approximation with nonconvex constraints
• scientific article; zbMATH DE number 1303653

Cites work

• scientific article; zbMATH DE number 2121575 (Why is no real title available?)
• A dual approach to constrained interpolation from a convex subset of Hilbert space
• Best approximation in inner product spaces
• Characterizing best approximation from a convex set without convex representation
• Characterizing nonconvex constrained best approximation using Robinson's constraint qualification
• Constrained best approximation in Hilbert space
• Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
• Convex analysis and monotone operator theory in Hilbert spaces
• Introduction to nonsmooth optimization. Theory, practice and software
• Lagrange multiplier characterizations of constrained best approximation with infinite constraints
• Lagrange multiplier characterizations of constrained best approximation with nonsmooth nonconvex constraints
• Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
• On the functions with pseudoconvex sublevel sets and optimality conditions
• Robust constrained best approximation with nonconvex constraints
• Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization
• Variational analysis and applications

This page was built for publication: Best approximation with geometric constraints

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