Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



A nearest point algorithm for convex polyhedral cones and applications to positive linear approximation

Author: Don R. Wilhelmsen
Journal: Math. Comp. 30 (1976), 48-57
MSC: Primary 52A25; Secondary 65D99
MathSciNet review: 0394439
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: Suppose K is a convex polyhedral cone in ${E_n}$ and is defined in terms of some generating set $\{ {e_1},{e_2}, \ldots ,{e_N}\}$. A procedure is devised so that, given any point $q \in {E_n}$, the nearest point p in K to q can be found as a positive linear sum of ${N^\ast } \leqslant n$ points from the generating set. The procedure requires at most finitely many linear steps. The algorithm is then applied to find a positive representation \[ Lf = \sum \limits _{i = 1}^{{N^\ast }} {{\lambda _i}f({x_i}),} \quad {\lambda _i} > 0,f \in \Phi ,\] for a positive linear functional L acting on a suitable finite-dimensional function space $\Phi$.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 52A25, 65D99

Retrieve articles in all journals with MSC: 52A25, 65D99

Additional Information

Keywords: Convex set, nearest point, projection, positive linear approximation, linear algorithm, cubature
Article copyright: © Copyright 1976 American Mathematical Society