Gearhart-Koshy Acceleration for Affine Subspaces
From MaRDI portal
Publication:6344247
Convex programming (90C25) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Algorithms for approximation of functions (65D15) Programming in abstract spaces (90C48)
Abstract: The method of cyclic projections finds nearest points in the intersection of finitely many affine subspaces. To accelerate convergence, Gearhart and Koshy proposed a modification which, in each iteration, performs an exact line search based on minimising the distance to the solution. When the subspaces are linear, the procedure can be made explicit using feasibility of the zero vector. This work studies an alternative approach which does not rely on this fact, thus providing an efficient implementation in the affine setting.
This page was built for publication: Gearhart-Koshy Acceleration for Affine Subspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6344247)
