Cyclic subgradient projections
From MaRDI portal
Publication:3953572
DOI10.1007/BF01585107zbMath0491.90077MaRDI QIDQ3953572
Publication date: 1982
Published in: Mathematical Programming (Search for Journal in Brave)
image reconstruction; convex feasibility problem; sparse problems; subgradient projections; point search; emission computerized tomography; huge problems; intersection of closed convex sets
Related Items
Hilbertian convex feasibility problem: Convergence of projection methods, A method for approximating the solution set of a system of convex inequalities by polytopes, A superlinearly convergent projection algorithm for solving the convex inequality problem, A row-action method for convex programming, Block-iterative surrogate projection methods for convex feasibility problems, Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems, Primal-dual row-action method for convex programming, Algorithms for the quasiconvex feasibility problem, An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem, On finitely convergent iterative methods for the convex feasibility problem