A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
From MaRDI portal
Publication:4091361
DOI10.2307/2005429zbMath0326.65024MaRDI QIDQ4091361
Publication date: 1976
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2005429
65D15: Algorithms for approximation of functions
65D30: Numerical integration
52Bxx: Polytopes and polyhedra
Related Items
The steepest descent gravitational method for linear programming, Exterior point algorithms for nearest points and convex quadratic programs, Algorithmic equivalence in quadratic programming. I. A least-distance programming problem, An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane, An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set, A gravitational interior point method for LP., An algorithm for least distance programming, A critical index algorithm for nearest point problems on simplicial cones, Finding the nearest point in A polytope