Cyclic subgradient projections
From MaRDI portal
Publication:3953572
DOI10.1007/BF01585107zbMath0491.90077OpenAlexW2092527476MaRDI QIDQ3953572
Publication date: 1982
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585107
image reconstructionconvex feasibility problemsparse problemssubgradient projectionspoint searchemission computerized tomographyhuge problemsintersection of closed convex sets
Related Items
A row-action method for convex programming, Strong convergence of projection-like methods in Hilbert spaces, A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space, Improved constraint consensus methods for seeking feasibility in nonlinear programs, Block-iterative surrogate projection methods for convex feasibility problems, Linear Convergence of Subgradient Algorithm for Convex Feasibility on Riemannian Manifolds, Using projected cutting planes in the extended cutting plane method, On finitely convergent iterative methods for the convex feasibility problem, Primal-dual row-action method for convex programming, A finitely convergent ``row-action method for the convex feasibility problem, Perturbed projections and subgradient projections for the multiple-sets split feasibility problem, On some optimization techniques in image reconstruction from projections, Parallel application of block-iterative methods in medical imaging and radiation therapy, Subgradient projection algorithms and approximate solutions of convex feasibility problems, Minimization of equilibrium problems, variational inequality problems and fixed point problems, Distributed solutions for loosely coupled feasibility problems using proximal splitting methods, Strong convergence of alternating projections, A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators, An acceleration scheme for cyclic subgradient projections method, Subgradient method for convex feasibility on Riemannian manifolds, Convex feasibility modeling and projection methods for sparse signal recovery, Subgradient projectors: extensions, theory, and characterizations, Algorithmic approach to a minimization problem, Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour, Finite convergence of a subgradient projections method with expanding controls, An interior points algorithm for the convex feasibility problem, Comparing Averaged Relaxed Cutters and Projection Methods: Theory and Examples, A method for approximating the solution set of a system of convex inequalities by polytopes, Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods, Convergence analysis of a parallel projection algorithm for solving convex feasibility problems, Hilbertian convex feasibility problem: Convergence of projection methods, On the string averaging method for sparse common fixed‐point problems, Unnamed Item, Non-monotonous sequential subgradient projection algorithm for convex feasibility problem, Non-monotonous accelerated parallel subgradient projection algorithm for convex feasibility problem, An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem, Extrapolation algorithm for affine-convex feasibility problems, A generalized projection-based scheme for solving convex constrained optimization problems, A general iterative scheme with applications to convex optimization and related fields, Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems, Relaxed outer projections, weighted averages and convex feasibility, Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm, A superlinearly convergent projection algorithm for solving the convex inequality problem, Quasi-convex feasibility problems: subgradient methods and convergence rates, Some modified relaxed alternating projection methods for solving the two-sets convex feasibility problem, Algorithms for the quasiconvex feasibility problem, On Subgradient Projectors, An automatic relaxation method for solving interval linear inequalities, On the finite convergence of a projected cutter method, The projection method for solving nonlinear systems of equations under the most violated constraint control
Cites Work
- An interior points algorithm for the convex feasibility problem
- Symmetric duality, and a convergent subgradient method for discrete, linear, constrained approximation problems with arbitrary norms appearing in the objective function and in the constraints
- Extensions of Hildreth’s Row-Action Method for Quadratic Programming
- The method of projections for finding the common point of convex sets
- Unnamed Item
- Unnamed Item
