Variable target value relaxed alternating projection method
From MaRDI portal
Publication:616797
DOI10.1007/s10589-009-9233-xzbMath1208.90181OpenAlexW2069797673MaRDI QIDQ616797
R. 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
Related Items (3)
Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes ⋮ Iterative algorithm for solving a class of convex feasibility problem ⋮ An acceleration scheme for Dykstra's algorithm
Cites Work
- Variable target value subgradient method
- Dykstra's alternating projection algorithm for two sets
- A method of projection onto an acute cone with level control in convex minimization
- Extrapolation algorithm for affine-convex feasibility problems
- Relaxed Alternating Projection Methods
- Accelerating the convergence of the method of alternating projections
- Residual Selection in A Projection Method for Convex Minimization Problems
- Selection strategies in projection methods for convex minimization problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
This page was built for publication: Variable target value relaxed alternating projection method
