Relaxed Alternating Projection Methods

DOI10.1137/070698750zbMath1180.65073OpenAlexW2050916497MaRDI QIDQ3395006

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

weak convergencenumerical resultsFejér monotonicityalternating projection method

Mathematics Subject Classification ID

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

Related Items (14)

Optimal rates of linear convergence of relaxed alternating projections and generalized Douglas-Rachford methods for two subspaces ⋮ Variable target value relaxed alternating projection method ⋮ Random algorithms for convex minimization problems ⋮ Incremental proximal methods for large scale convex optimization ⋮ Iterative algorithm for solving a class of convex feasibility problem ⋮ On the existence of minimizers of proximity functions for split feasibility problems ⋮ Incomplete alternating projection method for large inconsistent linear systems ⋮ Alternating projection method for sparse model updating problems ⋮ Optimal rates of linear convergence of the averaged alternating modified reflections method for two subspaces ⋮ Stochastic First-Order Methods with Random Constraint Projection ⋮ An acceleration scheme for Dykstra's algorithm ⋮ Incremental Constraint Projection Methods for Monotone Stochastic Variational Inequalities ⋮ Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem ⋮ Incremental constraint projection methods for variational inequalities

This page was built for publication: Relaxed Alternating Projection Methods