Relaxed outer projections, weighted averages and convex feasibility
From MaRDI portal
Publication:751771
Recommendations
- Convergence of weighted averages of relaxed projections
- Weighted approximation for weak convex external fields
- On relaxed and contraction-proximal point algorithms in Hilbert spaces
- Projections on convex sets in the relaxed limit
- scientific article; zbMATH DE number 2227334
- A relaxed projection method for variational inequalities
- Convex relaxations and integrality gaps
- Upper Perturbation Bounds of Weighted Projections, Weighted and Constrained Least Squares Problems
- A method for weighted projections to the positive definite cone
- Generalized Bregman projections in convex feasibility problems
Cites work
- scientific article; zbMATH DE number 3890233 (Why is no real title available?)
- scientific article; zbMATH DE number 3912113 (Why is no real title available?)
- scientific article; zbMATH DE number 3628731 (Why is no real title available?)
- scientific article; zbMATH DE number 3027894 (Why is no real title available?)
- A Simultaneous Iterative Method for Computing Projections on Polyhedra
- A finitely convergent ``row-action method for the convex feasibility problem
- A primal-dual projection method for solving systems of linear inequalities
- A simultaneous projections method for linear inequalities
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Convergence results for an accelerated nonlinear Cimmino algorithm
- Cyclic subgradient projections
- Decomposition through formalization in a product space
- Parallel and sequential Kaczmarz methods for solving underdetermined nonlinear equations
- Parallel application of block-iterative methods in medical imaging and radiation therapy
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- 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
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Solving Systems of Linear Inequalities
- The method of projections for finding the common point of convex sets
Cited in
(32)- Projection methods for the linear split feasibility problems
- Generalized Bregman projections in convex feasibility problems
- On the convergence of Han's method for convex programming with quadratic objective
- Finding projections onto the intersection of convex sets in hilbert spaces
- A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space
- The use of additional diminishing disturbances in Fejer models of iterative algorithms
- Extrapolation algorithm for affine-convex feasibility problems
- Iterative method for solving the linear feasibility problem
- A generalized block-iterative projection method for the common fixed point problem induced by cutters
- Weak, strong, and linear convergence of a double-layer fixed point algorithm
- A method for approximating the solution set of a system of convex inequalities by polytopes
- Averaged Subgradient Methods for Constrained Convex Optimization and Nash Equilibria Computation
- Subgradient projection algorithms and approximate solutions of convex feasibility problems
- A convergence result on random products of mappings in metric spaces
- Block-iterative surrogate projection methods for convex feasibility problems
- Regular Sequences of Quasi-Nonexpansive Operators and Their Applications
- A convergence result on random products of mappings in metric trees
- Block iterative methods for a finite family of relatively nonexpansive mappings in Banach spaces
- Geometrically convergent projection method in matrix games
- An open question on cyclic relaxation
- Block Iterative Methods for a Finite Family of Generalized Nonexpansive Mappings in Banach Spaces
- Subgradient projection algorithms for convex feasibility problems in the presence of computational errors
- Cases of ineffectiveness of geometric cuts in sequential projection methods
- Opial-type theorems and the common fixed point problem
- Convergence criteria for generalized gradient methods of solving locally Lipschitz feasibility problems
- A superlinearly convergent projection algorithm for solving the convex inequality problem
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- Linear convergence rates for extrapolated fixed point algorithms
- Strong convergence of expected-projection methods in hilbert spaces
- Hilbertian convex feasibility problem: Convergence of projection methods
- Non-Convex feasibility problems and proximal point methods
- Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces
This page was built for publication: Relaxed outer projections, weighted averages and convex feasibility
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751771)
