Relaxed Alternating Projection Methods
From MaRDI portal
Publication:3395006
DOI10.1137/070698750zbMATH Open1180.65073OpenAlexW2050916497MaRDI QIDQ3395006FDOQ3395006
Authors: Andrzej Cegielski, Agnieszka Suchocka 
Publication date: 20 August 2009
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070698750
Recommendations
- Variable target value relaxed alternating projection method
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Dykstra's alternating projection algorithm for two sets
- A new geometric acceleration of the von Neumann-Halperin projection method
- scientific article; zbMATH DE number 2148414
Cited In (26)
- The alternating algorithm in a uniformly convex and uniformly smooth Banach space
- A generalization of the Friedrichs angle and the method of alternating projections
- On the convergence of von Neumann's alternating projection algorithm for two sets
- Incomplete alternating projection method for large inconsistent linear systems
- Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
- Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities
- Iterative algorithm for solving a class of convex feasibility problem
- Incremental proximal methods for large scale convex optimization
- Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
- Alternating projection methods.
- Stochastic first-order methods with random constraint projection
- Some convergence strategies for the alternating generalized projection method
- An acceleration scheme for Dykstra's algorithm
- Random algorithms for convex minimization problems
- Title not available (Why is that?)
- The Convergence of an Algorithm for Finding the Distance between a Ball in a Subspace and a Sum of Subspaces
- Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces
- Variable target value relaxed alternating projection method
- Incremental constraint projection methods for variational inequalities
- On the existence of minimizers of proximity functions for split feasibility problems
- The method of alternating projections and the method of subspace corrections in Hilbert space
- Unconstrained optimization techniques for the acceleration of alternating projection methods
- Alternating projections on nontangential manifolds
- Title not available (Why is that?)
- Alternating projection method for sparse model updating problems
- Title not available (Why is that?)
This page was built for publication: Relaxed Alternating Projection Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3395006)
