Variable target value relaxed alternating projection method
From MaRDI portal
Publication:616797
DOI10.1007/S10589-009-9233-XzbMATH Open1208.90181OpenAlexW2069797673MaRDI QIDQ616797FDOQ616797
Robert Dylewski, Andrzej Cegielski
Publication date: 12 January 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-009-9233-x
Recommendations
- Relaxed Alternating Projection Methods
- Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes
- Dykstra's alternating projection algorithm for two sets
- scientific article
- On the convergence of von Neumann's alternating projection algorithm for two sets
Cites Work
- On Projection Algorithms for Solving Convex Feasibility Problems
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Accelerating the convergence of the method of alternating projections
- Dykstra's alternating projection algorithm for two sets
- Extrapolation algorithm for affine-convex feasibility problems
- Relaxed Alternating Projection Methods
- Variable target value subgradient method
- A method of projection onto an acute cone with level control in convex minimization
- Residual Selection in A Projection Method for Convex Minimization Problems
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
- Selection strategies in projection methods for convex minimization problems
Cited In (3)
This page was built for publication: Variable target value relaxed alternating projection method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616797)
