Relaxed Alternating Projection Methods

DOI10.1137/070698750MaRDI QIDQ3395006zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

numerical resultsweak convergencealternating projection methodFejér monotonicity

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25)

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)

• scientific article; zbMATH DE number 4101816 (Why is no real title available?)
• Random algorithms for convex minimization problems
• On the existence of minimizers of proximity functions for split feasibility problems
• Incomplete alternating projection method for large inconsistent linear systems
• A generalization of the Friedrichs angle and the method of alternating projections
• Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem
• Alternating projection methods.
• Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities
• Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces
• An acceleration scheme for Dykstra's algorithm
• Stochastic first-order methods with random constraint projection
• Iterative algorithm for solving a class of convex feasibility problem
• Unconstrained optimization techniques for the acceleration of alternating projection methods
• Some convergence strategies for the alternating generalized projection method
• Incremental proximal methods for large scale convex optimization
• The alternating algorithm in a uniformly convex and uniformly smooth Banach space
• The Convergence of an Algorithm for Finding the Distance between a Ball in a Subspace and a Sum of Subspaces
• Alternating projections on nontangential manifolds
• Variable target value relaxed alternating projection method
• Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces
• The method of alternating projections and the method of subspace corrections in Hilbert space
• scientific article; zbMATH DE number 2148414 (Why is no real title available?)
• Incremental constraint projection methods for variational inequalities
• On the convergence of von Neumann's alternating projection algorithm for two sets
• Alternating projection method for sparse model updating problems
• scientific article; zbMATH DE number 1552272 (Why is no real title available?)

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)