About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. I

DOI10.1016/0377-0427(94)90390-5zbMath0827.65059OpenAlexW2040054739MaRDI QIDQ1347165

Dieter Schott

Publication date: 11 December 1995

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

Full work available at URL: https://doi.org/10.1016/0377-0427(94)90390-5

zbMATH Keywords

error estimatesHilbert spaceiterative methodconvex feasibility problemgeometrical convergenceconvex problemprojection subgradient method

Mathematics Subject Classification ID

Iterative procedures involving nonlinear operators (47J25) Numerical solutions to equations with nonlinear operators (65J15)

Related Items (3)

About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. II ⋮ Iterative solution of convex problems by fejer-monotone methods ⋮ A Geometrical Look at Iterative Methods for Operators with Fixed Points

Cites Work

• Unnamed Item
• Unnamed Item
• Iterative Optimierungsverfahren, die unter schwachen Voraussetzungen konvergieren
• About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. II
• Convergence of the cyclical relaxation method for linear inequalities
• A general iterative scheme with applications to convex optimization and related fields
• The Relaxation Method for Solving Systems of Linear Inequalities
• An iterative method, having linear rate of convergence, for solving a pair of dual linear programs
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities

This page was built for publication: About geometrical convergence of general iterative methods applied to nonunique solvable convex problems. I