Some Algorithms for Computing Best Approximations from Convex Cones
- 1 June 1975
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 12 (3) , 390-403
- https://doi.org/10.1137/0712031
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Approximation with Convex ConstraintsSIAM Review, 1973
- Computation of best monotone approximationsMathematics of Computation, 1972
- Uniqueness of best approximation by monotone polynomialsJournal of Approximation Theory, 1971
- Best Approximation in Normed Linear Spaces by Elements of Linear SubspacesPublished by Springer Nature ,1970
- Degree of approximation by monotone polynomials IIJournal of Approximation Theory, 1969
- Degree of approximation by monotone polynomials IJournal of Approximation Theory, 1968
- Formulation of Linear Programs in Analysis. I: Approximation TheorySIAM Journal on Applied Mathematics, 1968
- Applications of the Hahn-Banach Theorem in Approximation TheorySIAM Review, 1967
- Quadratic Programming in Real Hilbert SpacesJournal of the Society for Industrial and Applied Mathematics, 1963
- Approximation with Convex ConstraintsJournal of the Society for Industrial and Applied Mathematics, 1963