Strong convergence of expected-projection methods in hilbert spaces
Dan Butnariu, Sjur Didrik Fl�m
Abstract
Dan Butnariu, Sjur Didrik Fl�m
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.
OpenAlex reports 32 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
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