Hilbertian convex feasibility problem: Convergence of projection methods

DOI10.1007/BF02683333zbMath0872.90069MaRDI QIDQ678107

Patrick L. Combettes

Publication date: 16 April 1997

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

zbMATH Keywords

Hilbert spacealternating projectionsconvex feasibility problemboundedly regular setschaotic iterationsconvex combinations of approximate projectionsintersection of countably many closed and convex setsweak and strong convergence results

Mathematics Subject Classification ID

Convex programming (90C25) General theory of numerical analysis in abstract spaces (65J05) Convergence and divergence of series and sequences (40A05) Programming in abstract spaces (90C48) Convex functions and convex programs in convex geometry (52A41)

Related Items (89)

General iterative methods for monotone mappings and pseudocontractive mappings related to optimization problems ⋮ Opial-Type Theorems and the Common Fixed Point Problem ⋮ Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems ⋮ A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space ⋮ Coincidence points by generalized Mann iterates with applications in Hilbert spaces ⋮ The Method of Cyclic Intrepid Projections: Convergence Analysis and Numerical Experiments ⋮ Stochastic block projection algorithms with extrapolation for convex feasibility problems ⋮ An asynchronous inertial algorithm for solving convex feasibility problems with strict pseudo-contractions in Hilbert spaces ⋮ Convergences of alternating projections in \(\mathrm{CAT}(\kappa)\) spaces ⋮ On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery ⋮ An iterative algorithm for common fixed points for nonexpansive semigroups and strictly pseudo-contractive mappings with optimization problems ⋮ Characterizations of stability of error bounds for convex inequality constraint systems ⋮ Rates of convergence of randomized Kaczmarz algorithms in Hilbert spaces ⋮ Finding best approximation pairs relative to two closed convex sets in Hilbert spaces ⋮ 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 ⋮ CONVERGENCE OF MANN’S ALTERNATING PROJECTIONS IN CAT() SPACES ⋮ Slow convergence of sequences of linear operators. II: Arbitrarily slow convergence ⋮ Unnamed Item ⋮ Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions ⋮ Polyak's gradient method for split feasibility problem constrained by level sets ⋮ Convergence rates for Kaczmarz-type algorithms ⋮ Asymptotic behavior of averaged and firmly nonexpansive mappings in geodesic 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 ⋮ A new general system of generalized nonlinear mixed composite-type equilibria and fixed point problems with an application to minimization problems ⋮ Automated Multilateral Negotiation on Multiple Issues with Private Information ⋮ Block-iterative algorithms for solving convex feasibility problems in Hilbert and in Banach spaces ⋮ A general iterative scheme for \(k\)-strictly pseudo-contractive mappings and optimization problems ⋮ AAR-based decomposition algorithm for non-linear convex optimisation ⋮ On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints ⋮ How good are extrapolated bi-projection methods for linear feasibility problems? ⋮ An iterative approach to quadratic optimization ⋮ 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 ⋮ Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour ⋮ Linear convergence rates for extrapolated fixed point algorithms ⋮ Convergence of weighted averages of relaxed projections ⋮ Finite convergence of a subgradient projections method with expanding controls ⋮ Unnamed Item ⋮ Projection and proximal point methods: Convergence results and counterexamples. ⋮ An iterative algorithm for solving fixed point problems, variational inequality problems and mixed equilibrium problems ⋮ String-averaging algorithms for convex feasibility with infinitely many sets ⋮ A system of generalized mixed equilibrium problems, maximal monotone operators, and fixed point problems with application to optimization problems ⋮ Iterative algorithms for variational inclusions, mixed equilibrium and fixed point problems with application to optimization problems ⋮ Convergence theorems for inertial KM-type algorithms ⋮ Effective metastability for a method of alternating resolvents ⋮ Unnamed Item ⋮ Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ? ⋮ Regular Sequences of Quasi-Nonexpansive Operators and Their Applications ⋮ Unnamed Item ⋮ Parallel algorithms for variational inequalities over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappings ⋮ A scratch covering algorithm using affine projection method ⋮ On the Finite Convergence of the Douglas--Rachford Algorithm for Solving (Not Necessarily Convex) Feasibility Problems in Euclidean Spaces ⋮ Common fixed points of strict pseudocontractions by iterative algorithms ⋮ Reflection-projection method for convex feasibility problems with an obtuse cone ⋮ Solving monotone inclusions via compositions of nonexpansive averaged operators ⋮ Functions with prescribed best linear approximations ⋮ Iterative approaches to convex feasibility problems in Banach spaces ⋮ Extrapolation algorithm for affine-convex feasibility problems ⋮ Regularization inertial proximal point algorithm for common solutions of a finite family of inverse-strongly monotone equations ⋮ Convergence theorems for split equality mixed equilibrium problems with applications ⋮ Accelerating two projection methods via perturbations with application to intensity-modulated radiation therapy ⋮ A general iterative method for addressing mixed equilibrium problems and optimization problems ⋮ A family of projection gradient methods for solving the multiple-sets split feasibility problem ⋮ Delaunay-based derivative-free optimization via global surrogates. II: Convex constraints ⋮ A finitely convergent circumcenter method for the convex feasibility problem ⋮ Nesterov perturbations and projection methods applied to IMRT ⋮ Stadium Norm and Douglas-Rachford Splitting: A New Approach to Road Design Optimization ⋮ Existence and approximation of solutions for Fredholm equations of the first kind with applications to a linear moment problem ⋮ Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities ⋮ Projection methods for finding the greatest element of the intersection of max-closed convex sets ⋮ Subgradient projection algorithms for convex feasibility problems in the presence of computational errors ⋮ Primal characterizations of stability of error bounds for semi-infinite convex constraint systems in Banach spaces ⋮ Convex feasibility problems on uniformly convex metric spaces ⋮ Mixed equilibrium problems and optimization problems ⋮ Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm ⋮ Projection algorithms with dynamic stepsize for constrained composite minimization ⋮ Some results for split equality equilibrium problems in Banach spaces ⋮ Normal property, Jameson property, CHIP and linear regularity for an infinite system of convex sets in Banach spaces ⋮ Random activations in primal-dual splittings for monotone inclusions with a priori information ⋮ A new hybrid iterative method for mixed equilibrium problems and variational inequality problem for relaxed cocoercive mappings with application to optimization problems ⋮ General Iterative Methods for Semigroups of Nonexpansive Mappings Related to Optimization Problems ⋮ -CONVERGENCES OF WEIGHTED AVERAGED PROJECTIONS IN SPACES ⋮ Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates ⋮ Perturbed iterative methods for a general family of operators: convergence theory and applications ⋮ Fixed point iterations coupled with relaxation factors and inertial effects ⋮ Hierarchical Minimization Problems and Applications ⋮ Incremental Quasi-Subgradient Method for Minimizing Sum of Geodesic Quasi-Convex Functions on Riemannian Manifolds with Applications ⋮ Generalized Mann iterates for constructing fixed points in Hilbert spaces

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
• Relaxed outer projections, weighted averages and convex feasibility
• Method of successive projections for finding a common point of sets in metric spaces
• Convergence results for an accelerated nonlinear Cimmino algorithm
• Strong convergence of projection-like methods in Hilbert spaces
• A finitely convergent ``row-action method for the convex feasibility problem
• An interior points algorithm for the convex feasibility problem
• Block-iterative surrogate projection methods for convex feasibility problems
• Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
• Image recovery by convex combinations of projections
• Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
• Random products of contractions in metric and Banach spaces
• Convergence theorems for sequences of nonlinear operators in Banach spaces
• On rings of operators. Reduction theory
• Proximity Maps for Convex Sets
• A limit theorem for projections
• Decomposition through formalization in a product space
• Relaxation methods for problems with strictly convex separable costs and linear constraints
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Cyclic subgradient projections
• Unrestricted iterations of nonexpansive mappings in Hilbert space
• On the Convergence of the Products of Firmly Nonexpansive Mappings
• Iterations of parallel convex projections in hilbert spaces
• On Projection Algorithms for Solving Convex Feasibility Problems
• Strong convergence of expected-projection methods in hilbert spaces
• A Norm Convergence Result on Random Products of Relaxed Projections in Hilbert Space
• 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: Hilbertian convex feasibility problem: Convergence of projection methods