Block-iterative surrogate projection methods for convex feasibility problems
From MaRDI portal
Publication:1347226
DOI10.1016/0024-3795(93)00089-IzbMath0821.65037MaRDI QIDQ1347226
Publication date: 4 April 1995
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
algorithms; convergence; projection methods; convex feasibility problem; block-iterative methods; set intersection problem
Related Items
Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization, PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS, Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings, Obtuse cones and Gram matrices with non-negative inverse, Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems, Hilbertian convex feasibility problem: Convergence of projection methods, A superlinearly convergent projection algorithm for solving the convex inequality problem, Generalized Bregman projections in convex feasibility problems, Extrapolation algorithm for affine-convex feasibility problems, Dykstras algorithm with bregman projections: A convergence proof, An algorithm with long steps for the simultaneous block projections approach for the linear feasibility problem, Projection methods for the linear split feasibility problems
Cites Work
- A numerically stable dual method for solving strictly convex quadratic programs
- Relaxed outer projections, weighted averages and convex feasibility
- Connections between the Cimmino-method and the Kaczmarz-method for the solution of singular and regular systems of equations
- A simultaneous projections method for linear inequalities
- An automatic relaxation method for solving interval linear inequalities
- Convergence results for an accelerated nonlinear Cimmino algorithm
- Strong convergence of projection-like methods in Hilbert spaces
- A parallel subgradient projections method for the convex feasibility problem
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- Reconstructing pictures from projections: On the convergence of the ART algorithm with relaxation
- On relaxation methods for systems of linear inequalities
- New methods for linear inequalities
- An interior points algorithm for the convex feasibility problem
- On the convergence of Han's method for convex programming with quadratic objective
- 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
- On the convergence of the discrete ART algorithm for the reconstruction of digital pictures from their projections
- New iterative methods for linear inequalities
- Surrogate methods for linear inequalities
- A class of methods for solving large convex systems
- A projection method for least-squares solutions to overdetermined systems of linear inequalities
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Convergence of the cyclical relaxation method for linear inequalities
- On the behavior of a block-iterative projection method for solving convex feasibility problems
- Technical Note—The Nested Ball Principle for the Relaxation Method
- Decomposition through formalization in a product space
- The Relaxation Method for Solving Systems of Linear Inequalities
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Feature Article—The Ellipsoid Method: A Survey
- Modifications and implementation of the ellipsoid algorithm for linear programming
- Cyclic subgradient projections
- Parallel Projected Aggregation Methods for Solving the Convex Feasibility Problem
- The method of projections for finding the common point of convex sets
- Minimization of unsmooth functionals
- On a relaxation method of solving systems of linear inequalities
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
