A new generalized projection algorithm unifies classical methods for two-set convex feasibility and provides convergence plus spectral parameter tuning for subspaces.
Convergence improvement and noise attenuation consi derations for beyond alias projection onto convex sets reconstruction
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Generalized Composed Alternating Relaxed Projection Algorithm for Two-Set Feasibility Problem
A new generalized projection algorithm unifies classical methods for two-set convex feasibility and provides convergence plus spectral parameter tuning for subspaces.