The projection method for solving nonlinear systems of equations under the ''most violated constraint'' control (Q1069671): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0898-1221(85)90019-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042509817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5652137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Row-Action Methods for Huge and Sparse Systems and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of projections for finding the common point of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5580053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4109207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic subgradient projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative procedure for the solution of constrained nonlinear equations with application to optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of underdetermined nonlinear equations by stationary iteration methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5627593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Local and Superlinear Convergence of Quasi-Newton Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Newton Methods, Motivation and Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of sparse linear least squares problems using Givens rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving linear least squares problems by Gram-Schmidt orthogonalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalization of the Methods of Brent and Brown for Solving Nonlinear Simultaneous Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving nonlinear simultaneous equations with a generalization of Brent's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative algorithms for large partitioned linear systems, with applications to image reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acceleration techniques for a class of x-projection methods for solving systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three dimensional x-projection method (with acceleration techniques) for solving systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Four dimensional x-projection method (with acceleration techniques) for solving systems of linear equations / rank
 
Normal rank

Latest revision as of 09:44, 17 June 2024

scientific article
Language Label Description Also known as
English
The projection method for solving nonlinear systems of equations under the ''most violated constraint'' control
scientific article

    Statements

    The projection method for solving nonlinear systems of equations under the ''most violated constraint'' control (English)
    0 references
    1985
    0 references
    This paper analyzes an extended version of \textit{S. Kaczmarz}' method [Bull. Inst. Acad. Polon. Sci. A 1937, 355-357 (1937; Zbl 0017.31703)] for solving nonlinear algebraic equations. The method is related to those of \textit{K.-H. Meyn} [Numer. Math. 42, 161-172 (1983; Zbl 0497.65026)] and the reviewer [Indiana Univ. Math. J. 26, 1137-1150 (1977; Zbl 0341.65046) and Numer. Math. 23, 371-385 (1975; Zbl 0303.65046)], but with the major improvement that the equations are treated generally by blocks. It is characterized by the use of local linearization in turn on each block that ``most'' violates the corresponding equations. The method is analyzed theoretically with convergence rate estimates. Some numerical results are also reported.
    0 references
    block version of Kaczmarz's method
    0 references
    convergence rate estimates
    0 references
    numerical results
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers