arXiv (All)
open access
The best approximation pair problem relative to two subsets in a normed space
In the classical best approximation pair (BAP) problem, one is given two nonempty, closed, convex and disjoint subsets in a finite- or an infinite-dimensional Hilbert space, and the goal is to find a pair of points, each from each subset, which realizes the distance between the subsets. Motivated by
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Korovkin-type approximation for non-positive operators#925708
- Norming Approximate Orthogonality in Normed Linear Spaces#1013595
- Local Reflexivity and Duality for Subspace Approximation Schemes#997340
- A sharp norm inequality for entanglement-breaking channels#1064450
- Approximation in reflexive Banach spaces and applications to the invariant subspace problem#1025966
Record · ID 984018
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive