An automatic relaxation method for solving interval linear inequalities
Journal of Mathematical Analysis and ApplicationsPublished 1 February 1985
Yair Censor
Citations24
SJR quartileQ1
SJR score0.85
SNIP1.14
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
An algorithm of the row-action type is proposed which, in each iterative step, effectively takes account of a pair of inequalities describing a single interval inequality.
Abstract
The problem of solving iteratively a large and possibly sparse system of interval linear inequalities α ⩽ Ax ⩽ β is considered. An algorithm of the row-action type is proposed which, in each iterative step, effectively takes account of a pair of inequalities describing a single interval inequality. The algorithm realizes in an automatic manner a relaxation principle proposed by Goffin but also allows further external relaxation parameters.
Keywords
Computer ScienceEngineering
Canadian Journal of MathematicsThe Relaxation Method for Linear Inequalities
560 Citations1954Shmuel Agmon
SIAM ReviewRow-Action Methods for Huge and Sparse Systems and Their Applications
480 Citations1981Yair Censor
Canadian Journal of MathematicsThe Relaxation Method for Linear Inequalities
465 Citations1954T. S. Motzkin, I. J. Schoenberg
Proceedings of the IEEEFinite series-expansion reconstruction methods
437 Citations1983Yair Censor
These methods are based on the discretization of the image domain prior to any mathematical analysis and thus are rooted in a completely different branch of mathematics than the transform methods which are discussed in this issue.
Mathematical ProgrammingOn convergence rates of subgradient optimization methods
242 Citations1977J. L. Goffin
Rates of convergence of subgradient optimization are studied and it is shown that if the step size is chosen to be a geometric progression with ratioρ the convergence, if it occurs, is geometric with rateρ.
Numerische MathematikStrong underrelaxation in Kaczmarz's method for inconsistent systems
221 Citations1983Yair Censor, P. P. B. Eggermont +1 more
Mathematical ProgrammingA relaxation method for reconstructing objects from noisy X-rays
122 Citations1975Gábor T. Herman
An algorithm is presented for estimating the density distribution in a cross section of an object from X-ray data, which in practice is unavoidably noisy, and a finite convergence result is proved.
Mathematical ProgrammingCyclic subgradient projections
106 Citations1982Yair Censor, Arnold Lent
A cyclically controlled method of subgradient projections (CSP) for the convex feasibility problem of solving convex inequalities is presented and a particular application to an image reconstruction problem of emission computerized tomography is mentioned.
Linear Algebra and its ApplicationsNew methods for linear inequalities
68 Citations1982Yair Censor, Tommy Elfving
North-Holland mathematics studiesIterative Methods for the Convex Feasibility Problem
37 Citations1984Yair Censor
Mathematical ProgrammingConvergence of the cyclical relaxation method for linear inequalities
34 Citations1984Jan Mandel
The relaxation method for linear inequalities is studied and new bounds on convergence obtained and an asymptotically tight estimate is given for the case when the inequalities are processed in a cyclical order.
Lecture notes in medical informaticsIntervals in Linear and Nonlinear Problems of Image Reconstruction
3 Citations1981Yair Censor
In the “series expansion” approach to image reconstruction, the mathematical formulation takes the form of a system of equations, linear or nonlinear, which describes the real problem only approximately because discretization takes place at the very beginning of the series expansion approach.