The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case

Suppose K is the intersection of a finite number of closed half-spaces in a Hilbert space X. Starting with any point xεX, it is shown that the sequence of iterates {x n } generated by Dykstra's cyclic projections algorithm satisfies the inequality for all n, where P K (x) is the nearest point i...

Full description

Bibliographic Details

Published in:	Numerical functional analysis and optimization Vol. 15; no. 5-6; pp. 537 - 565
Main Authors:	Deutsch, Frank, Hundal, Hein
Format:	Journal Article
Language:	English
Published:	Marcel Dekker, Inc 01.01.1994
Subjects:	alternating projections best approximations from polyhedra convex regression cyclic projections Hildreth's algorithm isotone regression iterative projections linear inequalities linear programming Primary 41A65 quadratic programming rate of convergence of Dykstra's algorithm Secondary 47N10 Secondary 49M30 subject classification
ISSN:	0163-0563, 1532-2467
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!