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

zbMATH Open1180.90187MaRDI QIDQ842297

N. E. Zubov

Publication date: 22 September 2009

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

zbMATH Keywords

linear convergenceconvex feasibility problemsuccessive orthogonal projections algorithm

Mathematics Subject Classification ID

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

Related Items (3)

A DUAL ALGORITHM FOR FINDING A NEAREST PAIR OF POINTS IN TWO POLYTOPES ⋮ Title not available (Why is that?) ⋮ An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)

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)