Abstract
An elementary algorithm for computing the infimum of two projections in a Hilbert space is examined constructively. It is shown that in order to obtain a constructive convergence proof for the algorithm, one must add some hypotheses such as Markov's principle or the locatedness of a certain range; and that in the finite-dimensional case, the existence of both the infimum and the supremum of the two projections suffices for the convergence of the algorithm. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Bridges, D. S., & Vîţǎ, L. S. (2012). Constructing the infimum of two projections. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7160 LNCS, pp. 46–58). https://doi.org/10.1007/978-3-642-27654-5_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
