A quasi-Newton method with modification of one column per iteration
type: Item
instance of: scholarly article
title: A quasi-Newton method with modification of one column per iteration
zbMATH Open document ID: 0546.90102
DOI: 10.1007/BF02242278
published in: Computing
publication date: 1984-01-01T00:00:00Z
review text: We introduce a new quasi-Newton method for solving nonlinear simultaneous equations. At each iteration only one column of \(B_ k\) is changed to obtain \(B_{k+1}\). This permits to use the well-known techniques of Linear Programming for modifying the factorization of \(B_ k\). We present a local convergence theorem for a restarted version of the method. The new algorithm is compared numerically with some other methods which were introduced for solving the same kind of problems.
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 65H10
zbMATH DE Number: 3871065
zbMATH Keywords: quasi-Newton method
zbMATH Keywords: nonlinear simultaneous equations
zbMATH Keywords: local convergence theorem
zbMATH Keywords: restarted version
author: J. M. Martínez
MaRDI profile type: Publication
cites work: The simplex method of linear programming using LU decomposition
cites work: Some Efficient Algorithms for Solving Systems of Nonlinear Equations
cites work: A Class of Methods for Solving Nonlinear Simultaneous Equations
cites work: On the Local and Superlinear Convergence of Quasi-Newton Methods
cites work: Direct Secant Updates of Matrix Factorizations
cites work: A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
cites work: Quasi-Newton Methods, Motivation and Theory
cites work: Some Convergence Properties of Broyden’s Method
cites work: Methods for Modifying Matrix Factorizations
cites work: On the Bartels—Golub decomposition for linear programming bases
cites work: A Stable Variant of the Secant Method for Solving Nonlinear Equations
cites work: Generalization of the Methods of Brent and Brown for Solving Nonlinear Simultaneous Equations
cites work: Three new algorithms based on the sequential secant method
cites work: Solving nonlinear simultaneous equations with a generalization of Brent's method
cites work: Testing Unconstrained Optimization Software
cites work: Q5652137
cites work: Q4060241
cites work: Überlinear konvergente Mehrschrittverfahren vom Regula falsi‐ und Newton‐Typ
cites work: Modification of a Quasi-Newton Method for Nonlinear Equations with a Sparse Jacobian
cites work: Über die Realisierung und Konvergenz von Mehrschrittverfahren zur iterativen Lösung nichtlinearer Gleichungen
cites work: Q4187244
full work available at URL: https://doi.org/10.1007/bf02242278
OpenAlex ID: W154728897
description: scientific article; zbMATH DE number 3871065