Convergence results for an accelerated nonlinear cimmino algorithm
Numerische MathematikPublished 1 July 1986
Alfredo N. Iusem, Alvaro Rodolfo De Pierro
Citations85
SJR quartileQ1
SJR score1.64
SNIP1.57
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.
Abstract
We present an accelerated version of Cimmino's algorithm for solving the convex feasibility problem in finite dimension. The algorithm is similar to that given by Censor and Elfving for linear inequalities. We show that the nonlinear version converges locally to a weighted least squares solution in the general case and globally to a feasible solution in the consistent case. Applications to the linear problem are suggested.
Keywords
Computer ScienceMathematicsEngineering
Students Quarterly JournalOptimization by Vector Space Methods
6,128 Citations1970
This book shows engineers how to use optimization theory to solve complex problems with a minimum of mathematics and unifies the large field of optimization with a few geometric principles.
Journal of the London Mathematical SocietyTHE THEORY OF MATRICES IN NUMERICAL ANALYSIS
1,171 Citations1965L. Mirsky
USSR Computational Mathematics and Mathematical PhysicsThe method of projections for finding the common point of convex sets
732 Citations1967L.G. Gubin, B. T. Polyak +1 more
Various methods of finding points from the intersection of sets, using projection on to a separate set as an elementary operation are considered, and the strong convergence of the sequences obtained is proved.
SIAM ReviewRow-Action Methods for Huge and Sparse Systems and Their Applications
480 Citations1981Yair Censor
Numerische MathematikBlock-iterative methods for consistent and inconsistent linear equations
220 Citations1980Tommy Elfving
An application is given to the linear system that arises from reconstruction of a two-dimensional object by its one-dimensional projections.
Numerische MathematikComputing elliptic integrals by duplication
175 Citations1979B. C. Carlson
Logarithms, arctangents, and elliptic integrals of all three kinds are evaluated numerically by successive applications of the duplication theorem, finding that when the convergence is improved by including a fixed number of terms of Taylor's series, the error ultimately decreases by a factor of 4096 in each cycle of iteration.
Linear Algebra and its ApplicationsA simultaneous projections method for linear inequalities
78 Citations1985Alvaro R. De Pierro, Alfredo N. Iusem
Linear Algebra and its ApplicationsNew methods for linear inequalities
68 Citations1982Yair Censor, Tommy Elfving
IMA Journal of Applied MathematicsA Storage-Efficient Algorithm for Finding the Regularized Solution of a Large, Inconsistent System of Equations
50 Citations1980Gábor T. Herman, Arnold Lent +1 more
Lecture notes in medical informaticsContinuous and Semicontinuous Analogues of Iterative Methods of Cimmino and Kaczmarz with Applications to the Inverse Radon Transform
23 Citations1981M. Zuhair Nashed
The Computer JournalProjection Methods for Solving Sparse Linear Systems
21 Citations1969R. P. Tewarson
Some methods of successive approximation for the solution of simultaneous linear equations are discussed and it is shown that savings in the computer storage and the computing time are possible, if there exists a subset of the rows (columns) of A, consisting of only orthogonal rows ( columns).