Variable target value relaxed alternating projection method
From MaRDI portal
(Redirected from Publication:616797)
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; zbMATH DE number 4101816
- On the convergence of von Neumann's alternating projection algorithm for two sets
Cites work
- A method of projection onto an acute cone with level control in convex minimization
- Accelerating the convergence of the method of alternating projections
- Dykstra's alternating projection algorithm for two sets
- Extrapolation algorithm for affine-convex feasibility problems
- On Projection Algorithms for Solving Convex Feasibility Problems
- Relaxed Alternating Projection Methods
- Residual Selection in A Projection Method for Convex Minimization Problems
- Selection strategies in projection methods for convex minimization problems
- The Efficiency of Subgradient Projection Methods for Convex Optimization, Part I: General Level Methods
- Variable target value subgradient method
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
Cited in
(6)- Iterative algorithm for solving a class of convex feasibility problem
- Relaxed Alternating Projection Methods
- Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes
- An acceleration scheme for Dykstra's algorithm
- Centralized circumcentered-reflection method for solving the convex feasibility problem in sparse signal recovery
- A fast algorithm for solving the low rank matrix feasibility problem in quantum marginal computing
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)
