Strong convergence of projection-like methods in Hilbert spaces

DOI10.1007/BF00939552zbMath0621.49019MaRDI QIDQ1089908

N. Ottavy

Publication date: 1988

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

strong convergenceHilbert spacesunified frameworkprojection-like methodsregular familySlater convex setsuniformly convex sets

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Decomposition methods (49M27) Convex sets in topological vector spaces (aspects of convex geometry) (52A07) Numerical methods of relaxation type (49M20) Inner product spaces and their generalizations, Hilbert spaces (46C99)

Related Items (15)

Weak and norm convergence of a parallel projection method in Hilbert spaces ⋮ Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems ⋮ Strong convergence of almost simultaneous block-iterative projection methods in Hilbert spaces ⋮ Block-iterative surrogate projection methods for convex feasibility problems ⋮ Iterations of parallel convex projections in hilbert spaces ⋮ Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions ⋮ Strong convergence of expected-projection methods in hilbert spaces ⋮ On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints ⋮ Method of successive projections for finding a common point of sets in metric spaces ⋮ Convergence of weighted averages of relaxed projections ⋮ Cyclic projection methods on a class of nonconvex sets ⋮ Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems ⋮ Hilbertian convex feasibility problem: Convergence of projection methods ⋮ Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems ⋮ Extrapolation algorithm for affine-convex feasibility problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Contraction en norme vectorielle: Convergence d'itérations chaotiques pour des équations non linéaires de point fixe à plusieurs variables
• Chaotic relaxation
• Projection method for solving a singular system of linear equations and its applications
• Decomposition through formalization in a product space
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Cyclic subgradient projections
• Relaxation methods for image reconstruction
• Asynchronous Iterative Methods for Multiprocessors
• 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: Strong convergence of projection-like methods in Hilbert spaces