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

DOI10.1016/0377-0427(94)90390-5zbMath0827.65059MaRDI 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 estimates; Hilbert space; iterative method; convex feasibility problem; geometrical convergence; convex problem; projection subgradient method

Mathematics Subject Classification ID

47J25: Iterative procedures involving nonlinear operators

65J15: Numerical solutions to equations with nonlinear operators

Related Items

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

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