1995•Numerical Functional Analysis and OptimizationRequires access

Strong convergence of expected-projection methods in hilbert spaces

Dan Butnariu, Sjur Didrik Fl�m

Open publisher page 32 citations

Abstract

Projection methods are iterative algorithms for computing common points of convex sets. They proceed via successive or simultaneous projections onto the given sets. Expected-projection methods, as defined in this work, generalize the simultaneous projection methods. We prove under quite mild conditions, that expected-projection methods in Hilbert spaces converge strongly to almost common points of infinite families of convex sets provided that such points exist. Relying on this result we show how expected-projection methods can be used to solve significant problems of applied mathematics.

About this research paper

What this paper is about

Projection methods are iterative algorithms for computing common points of convex sets. They proceed via successive or simultaneous projections onto the given sets. Expected-projection methods, as defined in this work, generalize the simultaneous projection methods. We prove under quite mild conditions, that expected-projection methods in Hilbert spaces converge strongly to almost common points of infinite families of convex sets provided that such points exist. Relying on this result we show how expected-projection methods can be used to solve significant problems of applied mathematics.

Why it matters

OpenAlex reports 32 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Projection methods are iterative algorithms for computing common points of convex sets. They proceed via successive or simultaneous projections onto the given sets. Expected-projection methods, as defined in this work, generalize the simultaneous projection methods. We prove under quite mild conditions, that expected-projection methods in Hilbert spaces converge strongly to almost common points of infinite families of convex sets provided that such points exist. Relying on this result we show how expected-projection methods can be used to solve significant problems of applied mathematics.

Key concepts: Mathematics, Projection (relational algebra), Hilbert space, Projection method, Regular polygon, Convergence (economics), Dykstra's projection algorithm, Applied mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Strong convergence of expected-projection methods in hilbert spaces — Research Paper | ScholarLens