Hilbertian convex feasibility problem: Convergence of projection methods
From MaRDI portal
Recommendations
- Convergence of projection algorithms to approximate solutions of convex feasibility problems
- scientific article; zbMATH DE number 7213713
- Convergence analysis of processes with valiant projection operators in Hilbert space
- A strongly convergent parallel projection algorithm for convex feasibility problem
Cites work
- scientific article; zbMATH DE number 4016617 (Why is no real title available?)
- scientific article; zbMATH DE number 3866537 (Why is no real title available?)
- scientific article; zbMATH DE number 3176320 (Why is no real title available?)
- scientific article; zbMATH DE number 65765 (Why is no real title available?)
- scientific article; zbMATH DE number 3806227 (Why is no real title available?)
- scientific article; zbMATH DE number 806611 (Why is no real title available?)
- scientific article; zbMATH DE number 3214008 (Why is no real title available?)
- scientific article; zbMATH DE number 3229228 (Why is no real title available?)
- scientific article; zbMATH DE number 3230744 (Why is no real title available?)
- scientific article; zbMATH DE number 3230748 (Why is no real title available?)
- scientific article; zbMATH DE number 3257595 (Why is no real title available?)
- scientific article; zbMATH DE number 3402056 (Why is no real title available?)
- scientific article; zbMATH DE number 3027894 (Why is no real title available?)
- A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space
- A finitely convergent ``row-action method for the convex feasibility problem
- A limit theorem for projections
- An interior points algorithm for the convex feasibility problem
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Block-iterative surrogate projection methods for convex feasibility problems
- Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
- Convergence results for an accelerated nonlinear Cimmino algorithm
- Convergence theorems for sequences of nonlinear operators in Banach spaces
- Cyclic subgradient projections
- Decomposition through formalization in a product space
- Image recovery by convex combinations of projections
- Iterations of parallel convex projections in hilbert spaces
- Method of successive projections for finding a common point of sets in metric spaces
- Minimization of unsmooth functionals
- On Projection Algorithms for Solving Convex Feasibility Problems
- On a relaxation method of solving systems of linear inequalities
- On rings of operators. Reduction theory
- On the Convergence of the Products of Firmly Nonexpansive Mappings
- Proximity Maps for Convex Sets
- Random products of contractions in metric and Banach spaces
- Relaxation methods for problems with strictly convex separable costs and linear constraints
- Relaxed outer projections, weighted averages and convex feasibility
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Strong convergence of expected-projection methods in hilbert spaces
- Strong convergence of projection-like methods in Hilbert spaces
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- Unrestricted iterations of nonexpansive mappings in Hilbert space
Cited in
(only showing first 100 items - show all)- A system of mixed equilibrium problems, a general system of variational inequality problems for relaxed cocoercive, and fixed point problems for nonexpansive semigroup and strictly pseudocontractive mappings
- A new hybrid iterative method for mixed equilibrium problems and variational inequality problem for relaxed cocoercive mappings with application to optimization problems
- scientific article; zbMATH DE number 7632133 (Why is no real title available?)
- Parallel algorithms for variational inequalities over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappings
- Finite convergence of a subgradient projections method with expanding controls
- Reflection-projection method for convex feasibility problems with an obtuse cone
- Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces
- Existence and approximation of solutions for Fredholm equations of the first kind with applications to a linear moment problem
- Viscosity iterative method for a split equality monotone variational inclusion problem
- General iterative methods for semigroups of nonexpansive mappings related to optimization problems
- Common fixed points of strict pseudocontractions by iterative algorithms
- Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces
- Fixed point iterations coupled with relaxation factors and inertial effects
- General iterative methods for monotone mappings and pseudocontractive mappings related to optimization problems
- Extrapolation algorithm for affine-convex feasibility problems
- Asymptotic behavior of averaged and firmly nonexpansive mappings in geodesic spaces
- Weak, strong, and linear convergence of a double-layer fixed point algorithm
- Randomized projection methods for convex feasibility: conditioning and convergence rates
- AAR-based decomposition algorithm for non-linear convex optimisation
- On projection reflection method in Hilbert spaces
- Finding best approximation pairs relative to two closed convex sets in Hilbert spaces
- Slow convergence of sequences of linear operators. II: Arbitrarily slow convergence
- Subgradient projection algorithms and approximate solutions of convex feasibility problems
- An iterative approach to quadratic optimization
- Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ?
- scientific article; zbMATH DE number 7213713 (Why is no real title available?)
- A convergence result on random products of mappings in metric spaces
- On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces
- scientific article; zbMATH DE number 5310524 (Why is no real title available?)
- A convergence result on random products of mappings in metric trees
- Functions with prescribed best linear approximations
- How good are extrapolated bi-projection methods for linear feasibility problems?
- The composition of projections onto closed convex sets in Hilbert space is asymptotically regular
- A general iterative scheme for \(k\)-strictly pseudo-contractive mappings and optimization problems
- Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints
- Hierarchical minimization problems and applications
- Generalized relaxations of nonexpansive operators and convex feasibility problems
- An iterative algorithm for solving fixed point problems, variational inequality problems and mixed equilibrium problems
- Convergence theorems for split equality mixed equilibrium problems with applications
- Coincidence points by generalized Mann iterates with applications in Hilbert spaces
- Polyak's gradient method for split feasibility problem constrained by level sets
- Iterative approaches to convex feasibility problems in Banach spaces
- An iterative method for solving a system of mixed equilibrium problems, system of quasivariational inclusions, and fixed point problems of nonexpansive semigroups with application to optimization problems
- Subgradient projection algorithms for convex feasibility problems in the presence of computational errors
- A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space
- Convergence of weighted averages of relaxed projections
- Convergence theorems for inertial KM-type algorithms
- The hybrid extragradient implicit approach for convex feasibility problems
- An iterative algorithm for common fixed points for nonexpansive semigroups and strictly pseudo-contractive mappings with optimization problems
- Generalized Mann iterates for constructing fixed points in Hilbert spaces
- Opial-type theorems and the common fixed point problem
- Method of successive projections for finding a common point of sets in metric spaces
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- Iterative algorithms for variational inclusions, mixed equilibrium and fixed point problems with application to optimization problems
- Projection and proximal point methods: Convergence results and counterexamples.
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- A system of generalized mixed equilibrium problems, maximal monotone operators, and fixed point problems with application to optimization problems
- A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space
- A general iterative method for addressing mixed equilibrium problems and optimization problems
- On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space
- Convergence of projection algorithms to approximate solutions of convex feasibility problems
- Mixed equilibrium problems and optimization problems
- Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
- Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces
- Convergence rates for Kaczmarz-type algorithms
- Iterations of parallel convex projections in hilbert spaces
- The method of cyclic intrepid projections: convergence analysis and numerical experiments
- scientific article; zbMATH DE number 7606922 (Why is no real title available?)
- A family of projection gradient methods for solving the multiple-sets split feasibility problem
- String-averaging algorithms for convex feasibility with infinitely many sets
- Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities
- Stadium norm and Douglas-Rachford splitting: a new approach to road design optimization
- Convex feasibility problems on uniformly convex metric spaces
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
- Nesterov perturbations and projection methods applied to IMRT
- Automated multilateral negotiation on multiple issues with private information
- A scratch covering algorithm using affine projection method
- A finitely convergent circumcenter method for the convex feasibility problem
- CONVERGENCE OF MANN’S ALTERNATING PROJECTIONS IN CAT() SPACES
- Primal characterizations of stability of error bounds for semi-infinite convex constraint systems in Banach spaces
- -CONVERGENCES OF WEIGHTED AVERAGED PROJECTIONS IN SPACES
- Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy
- Regular Sequences of Quasi-Nonexpansive Operators and Their Applications
- Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour
- An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces
- Effective metastability for a method of alternating resolvents
- Perturbed iterative methods for a general family of operators: convergence theory and applications
- Convergences of alternating projections in \(\mathrm{CAT}(\kappa)\) spaces
- Solving stochastic convex feasibility problems in hilbert spaces
- Some results for split equality equilibrium problems in Banach spaces
- Characterizations of stability of error bounds for convex inequality constraint systems
- The difference vectors for convex sets and a resolution of the geometry conjecture
- Projection algorithms with dynamic stepsize for constrained composite minimization
- Random activations in primal-dual splittings for monotone inclusions with a priori information
- Projection methods for finding the greatest element of the intersection of max-closed convex sets
- scientific article; zbMATH DE number 7733461 (Why is no real title available?)
- A new general system of generalized nonlinear mixed composite-type equilibria and fixed point problems with an application to minimization problems
- On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery
- Finitely convergent iterative methods with overrelaxations revisited
- Regularization inertial proximal point algorithm for common solutions of a finite family of inverse-strongly monotone equations
This page was built for publication: Hilbertian convex feasibility problem: Convergence of projection methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q678107)
