Revision as of 05:18, 5 November 2012 edit Michael Hardy (talk \| contribs) Administrators 210,577 edits No edit summary ← Previous edit		Revision as of 05:18, 5 November 2012 edit undo Michael Hardy (talk \| contribs) Administrators 210,577 edits →Algorithm Next edit →
Line 15: The algorithm starts with an arbitrary value for <math>x_0</math> and then generate the sequence : <math>x_{k+1} = \mathcal{P}_C \left( \mathcal{P}_D ( x_k ) \right). </math>. The simplicity of the algorithm explains some of its popularity. If the [[Intersection (set theory)\|intersection]] of ''C'' and ''D'' is non-empty, then the [[sequence]] generated by the algorithm will [[Convergent series\|converge]] to some point in this intersection.

Projections onto convex sets: Difference between revisions