An algorithm for solving the nearest point problem in an affine subspace

MaRDI QIDQ842297zbMATH OpenFDO

Authors N. E. Zubov

Publication date 22 September 2009

Published in Vietnam Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

convex feasibility problemlinear convergencesuccessive orthogonal projections algorithm

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical mathematical programming methods (65K05) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An algorithm for solving the minimum-norm point problem over the intersection of a polytope and an affine set
• An O(n) algorithm for projecting a vector on the intersection of a hyperplane and a box in R^n
• A new way of computing the orthogonal projection onto the intersection of two hyperplanes in a finite-dimensional Hilbert space
• Finding the projection on a polytope: An iterative method
• A O(n) algorithm for projecting a vector on the intersection of a hyperplane and R^n_+

Cited in

(8)

• An O(n) algorithm for projecting a vector on the intersection of a hyperplane and a box in R^n
• An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
• L_q-closest-point to affine subspaces using the generalized Weiszfeld algorithm
• scientific article; zbMATH DE number 1504656 (Why is no real title available?)
• A Newton Based Radius Reduction Algorithm for Nearest Point Problems in Pos Cones
• A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES
• An active index algorithm for the nearest point problem in a polyhedral cone
• Finding the orthogonal projection of a point onto an affine subspace

This page was built for publication: An algorithm for solving the nearest point problem in an affine subspace

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q842297)