A quasi-Newton method with modification of one column per iteration

DOI10.1007/BF02242278zbMath0546.90102OpenAlexW154728897MaRDI QIDQ798571

José Mario Martínez

Publication date: 1984

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02242278

zbMATH Keywords

quasi-Newton methodlocal convergence theoremnonlinear simultaneous equationsrestarted version

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Numerical computation of solutions to systems of equations (65H10) Linear programming (90C05)

Related Items (24)

Numerical experience with Newton-like methods for nonlinear algebraic systems ⋮ Parallel and sequential Kaczmarz methods for solving underdetermined nonlinear equations ⋮ Solving systems of nonlinear equations by means of an accelerated successive orthogonal projections method ⋮ Inverse analysis of Navier–Stokes equations using simplex search method ⋮ The column-updating method for solving nonlinear equations in Hilbert space ⋮ An extension of the theory of secant preconditioners ⋮ Quasi-Newton methods with derivatives ⋮ On the convergence of the column-updating method ⋮ Practical quasi-Newton algorithms for singular nonlinear systems ⋮ Inverse \(q\)-columns updating methods for solving nonlinear systems of equations ⋮ Accelerating the solution of a physics model inside a tokamak using the (inverse) column updating method ⋮ A globally convergent inexact Newton method with a new choice for the forcing term ⋮ Partitioned simulation of fluid-structure interaction. Coupling black-box solvers with quasi-Newton techniques ⋮ Two classes of multisecant methods for nonlinear acceleration ⋮ Solving nonlinear systems of equations by means of quasi-neston methods with a nonmonotone stratgy^∗ ⋮ Under-relaxed quasi-Newton acceleration for an inverse fixed-point problem coming from positron emission tomography ⋮ Computational experience with globally convergent descent methods for large sparse systems of nonlinear equations^∗ ⋮ The method of successive orthogonal projections for solving nonlinear simultaneous equations ⋮ A numerical study on large-scale nonlinear solvers ⋮ An algorithm for solving sparse nonlinear least squares problems ⋮ Variable metric methods for unconstrained optimization and nonlinear least squares ⋮ Practical quasi-Newton methods for solving nonlinear systems ⋮ Solution of nonlinear systems of equations by an optimal projection method ⋮ Quasi-Newton methods with factorization scaling for solving sparse nonlinear systems of equations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalization of the Methods of Brent and Brown for Solving Nonlinear Simultaneous Equations
• Some Convergence Properties of Broyden’s Method
• Testing Unconstrained Optimization Software
• Solving nonlinear simultaneous equations with a generalization of Brent's method
• Direct Secant Updates of Matrix Factorizations
• Über die Realisierung und Konvergenz von Mehrschrittverfahren zur iterativen Lösung nichtlinearer Gleichungen
• Quasi-Newton Methods, Motivation and Theory
• A Stable Variant of the Secant Method for Solving Nonlinear Equations
• On the Bartels—Golub decomposition for linear programming bases
• Three new algorithms based on the sequential secant method
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
• Überlinear konvergente Mehrschrittverfahren vom Regula falsi‐ und Newton‐Typ
• Methods for Modifying Matrix Factorizations
• A Class of Methods for Solving Nonlinear Simultaneous Equations
• The simplex method of linear programming using LU decomposition
• Modification of a Quasi-Newton Method for Nonlinear Equations with a Sparse Jacobian
• Some Efficient Algorithms for Solving Systems of Nonlinear Equations

This page was built for publication: A quasi-Newton method with modification of one column per iteration