An algorithm for approximation by elements of a cone in a banach space

DOI10.1080/01630568908816351zbMath0686.90041OpenAlexW1963561103MaRDI QIDQ4205248

V. P. Sreedharan, R. W. Owens

Publication date: 1989

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630568908816351

zbMATH Keywords

convergencebest approximationstrictly convex reflexive Banach spaceclosed convex cone of approximants

Mathematics Subject Classification ID

Normed linear spaces and Banach spaces; Banach lattices (46B99) Best approximation, Chebyshev systems (41A50) Programming in abstract spaces (90C48)

Related Items

A least distance algorithm for a smooth strictly convex norm

Cites Work

• Unnamed Item
• Unnamed Item
• Some geometric properties of the spheres in a normed linear space
• Subgradient projection algorithm. II
• Extensions of subgradient projection algorithms
• An algorithm for best approximate solutions of Ax=b with a smooth strictly convex norm
• Least-squares algorithms for finding solutions of overdetermined systems of linear equations which minimize error in a smooth strictly convex norm
• Algorithms for best \(L_ 1\) and \(L_ \infty\) linear approximations on a discrete set
• Least squares algorithms for finding solutions of overdetermined linear equations which minimize error in an abstract norm
• Reflexivity and the sup of linear functionals
• On an algorithm for best approximate solutions to Av=b in normed linear spaces
• Implementation of a subgradient projection algorithm II
• An algorithm for the best approximation by elements of a polyhedral set in banach spaces
• An algorithm for non-negative norm minimal solutions
• Some Algorithms for Computing Best Approximations from Convex Cones
• On the localization and directionalization of uniform convexity