RUS  ENG
Full version
JOURNALS // Doklady Rossijskoj Akademii Nauk. Mathematika, Informatika, Processy Upravlenia // Archive

Dokl. RAN. Math. Inf. Proc. Upr., 2021 Volume 500, Pages 87–91 (Mi danma208)

This article is cited in 1 paper

MATHEMATICS

Adaptive Gauss–Newton method for solving systems of nonlinear equations

N. E. Yudinab

a Moscow Institute of Physics and Technology (National Research University), Dolgoprudnyi, Moscow oblast, Russia
b Federal Research Center "Computer Science and Control" of Russian Academy of Sciences, Moscow, Russia

Abstract: For systems of nonlinear equations, we propose a new version of the Gauss–Newton method based on the idea of using an upper bound for the residual norm of the system and a quadratic regularization term. The global convergence of the method is proved. Under natural assumptions, global linear convergence is established. The method uses an adaptive strategy to choose hyperparameters of a local model, thus forming a flexible and convenient algorithm that can be implemented using standard convex optimization techniques.

Keywords: systems of nonlinear equations, unimodal optimization, Gauss–Newton method, Polyak–Łojasiewicz condition, inexact proximal mapping inexact oracle, underdetermined model, complexity estimate.

UDC: 519.853.62

Presented: Yu. G. Evtushenko
Received: 27.05.2021
Revised: 03.07.2021
Accepted: 05.07.2021

DOI: 10.31857/S2686954321050167


 English version:
Doklady Mathematics, 2021, 104:2, 293–296

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2026