Best approximation with geometric constraints
From MaRDI portal
Publication:6192591
DOI10.1007/S40065-023-00446-9OpenAlexW4387122609MaRDI QIDQ6192591FDOQ6192591
Publication date: 11 March 2024
Published in: Arabian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40065-023-00446-9
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)
Cites Work
- Title not available (Why is that?)
- Best approximation in inner product spaces
- Convex analysis and monotone operator theory in Hilbert spaces
- On the functions with pseudoconvex sublevel sets and optimality conditions
- Constraint qualifications and optimality conditions for nonconvex semi-infinite and infinite programs
- Nonlinearly Constrained Best Approximation in Hilbert Spaces: The Strong CHIP and the Basic Constraint Qualification
- A dual approach to constrained interpolation from a convex subset of Hilbert space
- Introduction to Nonsmooth Optimization
- Constrained best approximation in Hilbert space
- Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization
- Variational Analysis and Applications
- Characterizing best approximation from a convex set without convex representation
- Robust constrained best approximation with nonconvex constraints
- Lagrange multiplier characterizations of constrained best approximation with infinite constraints
- Characterizing nonconvex constrained best approximation using Robinson's constraint qualification
- Lagrange multiplier characterizations of constrained best approximation with nonsmooth nonconvex constraints
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)
