A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets

DOI10.1007/s10587-006-0031-7zbMath1164.47399MaRDI QIDQ3599881

Gilbert Crombez

Publication date: 9 February 2009

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/31042

zbMATH Keywords

nonlinear operators; projections onto convex sets; slow convergence

Mathematics Subject Classification ID

90C25: Convex programming

47H09: Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc.

47N10: Applications of operator theory in optimization, convex analysis, mathematical programming, economics

52A20: Convex sets in (n) dimensions (including convex hypersurfaces)

40A99: Convergence and divergence of infinite limiting processes

Related Items

Perturbed projections and subgradient projections for the multiple-sets split feasibility problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the acceleration of Kaczmarz's method for inconsistent linear systems
• Acceleration schemes for the method of alternating projections
• On the behavior of a block-iterative projection method for solving convex feasibility problems
• On Projection Algorithms for Solving Convex Feasibility Problems
• Viewing Parallel Projection Methods as Sequential Ones in Convex Feasibility Problems
• Semidefinite Programming
• Iterative solution of convex problems by fejer-monotone methods
• The method of projections for finding the common point of convex sets