Convergence results for an accelerated nonlinear Cimmino algorithm
From MaRDI portal
Publication:1061456
DOI10.1007/BF01389537zbMath0571.65051MaRDI QIDQ1061456
Alfredo Noel Iusem, Alvaro Rodolfo de Pierro
Publication date: 1986
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/133119
convergenceiterative algorithmsprojection methodsweighted least squaresconvex feasibility problemaccelerated nonlinear Cimmino algorithm
Related Items
Opial-Type Theorems and the Common Fixed Point Problem ⋮ A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space ⋮ A projection method for semidefinite linear systems and its applications ⋮ A non-interior continuation algorithm for solving the convex feasibility problem ⋮ Block-iterative surrogate projection methods for convex feasibility problems ⋮ Parallel application of block-iterative methods in medical imaging and radiation therapy ⋮ Iterations of parallel convex projections in hilbert spaces ⋮ Distributed solutions for loosely coupled feasibility problems using proximal splitting methods ⋮ On the behavior of a block-iterative projection method for solving convex feasibility problems ⋮ Strong convergence of expected-projection methods in hilbert spaces ⋮ Solving convex feasibility problems by a parallel projection method with geometrically-defined parameters ⋮ Generalization: One technique of computational and applied mathematical methodology ⋮ On the convergence of Han's method for convex programming with quadratic objective ⋮ Iterative algorithm for solving a class of convex feasibility problem ⋮ Hilbertian convex feasibility problem: Convergence of projection methods ⋮ An acceleration scheme for Dykstra's algorithm ⋮ Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems ⋮ Relaxed outer projections, weighted averages and convex feasibility ⋮ A superlinearly convergent projection algorithm for solving the convex inequality problem ⋮ Block-iterative projection methods for parallel computation of solutions to convex feasibility problems ⋮ Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods ⋮ An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Block-iterative methods for consistent and inconsistent linear equations
- A simultaneous projections method for linear inequalities
- New methods for linear inequalities
- A Storage-Efficient Algorithm for Finding the Regularized Solution of a Large, Inconsistent System of Equations
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- A method of iterative data refinement and its applications
- Projection Methods for Solving Sparse Linear Systems
- The method of projections for finding the common point of convex sets
