An algorithm for the best approximation by elements of a polyhedral set in banach spaces
From MaRDI portal
Publication:3745180
DOI10.1080/01630568308816166zbMath0606.65037OpenAlexW2129862406MaRDI QIDQ3745180
Publication date: 1983
Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/01630568308816166
General theory of numerical analysis in abstract spaces (65J05) Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)
Related Items
Estimating the distance from a point to a convex set ⋮ An algorithm for approximation by elements of a cone in a banach space
Cites Work
- Geometry of Banach spaces. Selected topics
- A generalization of the Farkas lemma and applications to convex programming
- Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm
- Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm
- On an algorithm for best approximate solutions to Av=b in normed linear spaces
- Convex Analysis
This page was built for publication: An algorithm for the best approximation by elements of a polyhedral set in banach spaces