Convergence of a quasi-Newton method for solving systems of nonlinear underdetermined equations

Abstract The development and convergence analysis of a quasi-Newton method for the solution of systems of nonlinear underdetermined equations is investigated. These equations arise in many application fields, e.g., supervised learning of large overparameterised neural networks, which require the development of efficient methods with guaranteed convergence. In this paper, a new approach for the computation of the Moore–Penrose inverse of the approximate Jacobian coming from the Broyden update is presented and a semi-local convergence result for a damped quasi-Newton method is proved. The theoretical results are illustrated in detail for the case of systems of multidimensional quadratic equations, and validated in the context of eigenvalue problems and supervised learning of overparameterised neural networks.

Authors

Institutions

Publication Details

Journal
Computational Optimization and Applications
Published
2024-09-06
DOI
https://doi.org/10.1007/s10589-024-00606-3
Citations
7
Primary Topic
Iterative Methods for Nonlinear Equations
Type
article
Field-Weighted Citation Impact
5.13

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Convergence of a quasi-Newton method for solving systems of nonlinear underdetermined equations

Alfio Borzı̀, Nadja Vater
7 citations
Computational Optimization and Applications
Iterative Methods for Nonlinear Equations
5.13
article

Convergence of a quasi-Newton method for solving systems of nonlinear underdetermined equations

Alfio Borzı̀, Nadja Vater
article en
7 citations

Abstract

Abstract The development and convergence analysis of a quasi-Newton method for the solution of systems of nonlinear underdetermined equations is investigated. These equations arise in many application fields, e.g., supervised learning of large overparameterised neural networks, which require the development of efficient methods with guaranteed convergence. In this paper, a new approach for the computation of the Moore–Penrose inverse of the approximate Jacobian coming from the Broyden update is presented and a semi-local convergence result for a damped quasi-Newton method is proved. The theoretical results are illustrated in detail for the case of systems of multidimensional quadratic equations, and validated in the context of eigenvalue problems and supervised learning of overparameterised neural networks.

Computational Optimization and ApplicationsVol. 91(2)
University of Würzburg (DE)
Bundesministerium für Bildung und Forschung, Julius-Maximilians-Universität Würzburg
Openalex Percentile: Top 4%
Iterative Methods for Nonlinear Equations
5.13
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Convergence of a quasi-Newton method for solving systems of nonlinear underdetermined equations — Alfio Borzı̀, Nadja Vater · Computational Optimization and Applications (2024) | TGRS Research Map | TGRS