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)
algorithmsconvergenceprojection methodsconvex feasibility problemblock-iterative methodsset intersection problem
Related Items (25)
Opial-Type Theorems and the Common Fixed Point Problem ⋮ Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings ⋮ PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS ⋮ Generalized Bregman projections in convex feasibility problems ⋮ A surrogate hyperplane Kaczmarz method for solving consistent linear equations ⋮ Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems ⋮ A dynamic distributed conjugate gradient method for variational inequality problem over the common fixed-point constraints ⋮ Projection methods for the linear split feasibility problems ⋮ Convergence of weighted averages of relaxed projections ⋮ Finite convergence of a subgradient projections method with expanding controls ⋮ Dykstras algorithm with bregman projections: A convergence proof ⋮ Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization ⋮ Nonlinear Forward-Backward Splitting with Projection Correction ⋮ Convergence analysis of a parallel projection algorithm for solving convex feasibility problems ⋮ Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems ⋮ Hilbertian convex feasibility problem: Convergence of projection methods ⋮ 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 ⋮ Obtuse cones and Gram matrices with non-negative inverse ⋮ Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings ⋮ Set intersection problems: supporting hyperplanes and quadratic programming ⋮ Cases of ineffectiveness of geometric cuts in sequential projection methods ⋮ A superlinearly convergent projection algorithm for solving the convex inequality problem ⋮ Unnamed Item
Cites Work
- 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
- 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
This page was built for publication: Block-iterative surrogate projection methods for convex feasibility problems
