An automatic relaxation method for solving interval linear inequalities

DOI10.1016/0022-247X(85)90127-1MaRDI QIDQ1060533zbMATH OpenFDO

Authors Yair Censor

Publication date 1985

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

Full work available at URL https://doi.org/10.1016/0022-247X(85)90127-1

zbMATH Keywords

image reconstructioninterval arithmeticinterval linear inequalitieslarge sparse systemssubgradient projection method

Mathematics Subject Classification ID

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

Review text

An iterative method for large sparse systems of interval linear inequalities is proposed. Each step consists of the orthogonal projection onto one of the defining hyperslabs, modified by an automatically generated relaxation parameter. This can be interpreted as a subgradient projection method for a suitable nonlinear problem, which proves convergence.

Recommendations

• New iterative methods for linear inequalities
• A simultaneous projections method for linear inequalities
• scientific article; zbMATH DE number 1112745
• A relaxation method for solving systems with infinitely many linear inequalities
• A conjugate gradient algorithm for sparse linear inequalities

Cites work

• A relaxation method for reconstructing objects from noisy X-rays
• Convergence of the cyclical relaxation method for linear inequalities
• Cyclic subgradient projections
• scientific article; zbMATH DE number 3856876 (Why is no real title available?)
• scientific article; zbMATH DE number 3866481 (Why is no real title available?)
• scientific article; zbMATH DE number 3912113 (Why is no real title available?)
• scientific article; zbMATH DE number 3244957 (Why is no real title available?)
• New methods for linear inequalities
• On convergence rates of subgradient optimization methods
• Row-Action Methods for Huge and Sparse Systems and Their Applications
• Strong underrelaxation in Kaczmarz's method for inconsistent systems
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Linear Inequalities
• The Relaxation Method for Solving Systems of Linear Inequalities

Cited in

(9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1060533)