Relaxed outer projections, weighted averages and convex feasibility
From MaRDI portal
Publication:751771
DOI10.1007/BF02017349zbMath0715.65038OpenAlexW1971915361MaRDI QIDQ751771
Publication date: 1990
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02017349
projection methodlarge-scale problemsconvex feasibilityweighted averagescommon point of finitely many closed nonconvex setsrelaxed outer projections
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, Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces, Block-iterative surrogate projection methods for convex feasibility problems, Averaged Subgradient Methods for Constrained Convex Optimization and Nash Equilibria Computation, Geometrically convergent projection method in matrix games, Subgradient projection algorithms and approximate solutions of convex feasibility problems, A convergence result on random products of mappings in metric spaces, A convergence result on random products of mappings in metric trees, Generalized Bregman projections in convex feasibility problems, Strong convergence of expected-projection methods in hilbert spaces, Finding projections onto the intersection of convex sets in hilbert spaces, Block Iterative Methods for a Finite Family of Generalized Nonexpansive Mappings in Banach Spaces, The use of additional diminishing disturbances in Fejer models of iterative algorithms, Projection methods for the linear split feasibility problems, Linear convergence rates for extrapolated fixed point algorithms, On the convergence of Han's method for convex programming with quadratic objective, A method for approximating the solution set of a system of convex inequalities by polytopes, Regular Sequences of Quasi-Nonexpansive Operators and Their Applications, Iterative method for solving the linear feasibility problem, Hilbertian convex feasibility problem: Convergence of projection methods, Block iterative methods for a finite family of relatively nonexpansive mappings in Banach spaces, A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space, Non-Convex feasibility problems and proximal point methods, Extrapolation algorithm for affine-convex feasibility problems, Subgradient projection algorithms for convex feasibility problems in the presence of computational errors, Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems, Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm, Cases of ineffectiveness of geometric cuts in sequential projection methods, A superlinearly convergent projection algorithm for solving the convex inequality problem, A generalized block-iterative projection method for the common fixed point problem induced by cutters
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A simultaneous projections method for linear inequalities
- A primal-dual projection method for solving systems of linear inequalities
- Convergence results for an accelerated nonlinear Cimmino algorithm
- Parallel and sequential Kaczmarz methods for solving underdetermined nonlinear equations
- A finitely convergent ``row-action method for the convex feasibility problem
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- 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
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Decomposition through formalization in a product space
- A Simultaneous Iterative Method for Computing Projections on Polyhedra
- The Relaxation Method for Solving Systems of Linear Inequalities
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Cyclic subgradient projections
- The method of projections for finding the common point of convex sets
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
