A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
From MaRDI portal
Publication:4091361
DOI10.2307/2005429zbMath0326.65024OpenAlexW4232307818MaRDI 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
Algorithms for approximation of functions (65D15) Numerical integration (65D30) Polytopes and polyhedra (52Bxx)
Related Items (16)
An algorithm for finding the minimum-norm point in the intersection of a convex polyhedron and a hyperplane ⋮ Fundamentals of cone regression ⋮ An update-and-stabilize framework for the minimum-norm-point problem ⋮ Low cardinality positive interior cubature on NURBS-shaped domains ⋮ The LP-Newton method for standard form linear programming problems ⋮ Extension of the LP-Newton method to conic programming problems via semi-infinite representation ⋮ Exterior point algorithms for nearest points and convex quadratic programs ⋮ A gravitational interior point method for LP. ⋮ The nearest point problem in a polyhedral set and its extensions ⋮ Finding the nearest point in A polytope ⋮ An active index algorithm for the nearest point problem in a polyhedral cone ⋮ The steepest descent gravitational method for linear programming ⋮ Algorithmic equivalence in quadratic programming. I. A least-distance programming problem ⋮ An algorithm for least distance programming ⋮ An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set ⋮ A critical index algorithm for nearest point problems on simplicial cones
This page was built for publication: A Nearest Point Algorithm for Convex Polyhedral Cones and Applications to Positive Linear Approximation.
