An automatic relaxation method for solving interval linear inequalities

DOI10.1016/0022-247X(85)90127-1zbMath0568.65022MaRDI QIDQ1060533

Yair Censor

Publication date: 1985

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

interval arithmeticsubgradient projection methodimage reconstructionlarge sparse systemsinterval linear inequalities

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Iterative numerical methods for linear systems (65F10)

Related Items (9)

Block-iterative surrogate projection methods for convex feasibility problems ⋮ On some optimization techniques in image reconstruction from projections ⋮ Parallel application of block-iterative methods in medical imaging and radiation therapy ⋮ A proximal point algorithm for minimax problems ⋮ Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems ⋮ Convergence analysis of processes with valiant projection operators in Hilbert space ⋮ A row relaxation method for large minimax problems ⋮ Radiation therapy treatment planning: An \(\mathcal L^ 2\) approach ⋮ The adventures of a simple algorithm

Cites Work

• New methods for linear inequalities
• Strong underrelaxation in Kaczmarz's method for inconsistent systems
• Convergence of the cyclical relaxation method for linear inequalities
• The Relaxation Method for Solving Systems of Linear Inequalities
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Cyclic subgradient projections
• A relaxation method for reconstructing objects from noisy X-rays
• On convergence rates of subgradient optimization methods
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An automatic relaxation method for solving interval linear inequalities