An Inertial‐Relaxed Newton‐Type Projection Method for Solving Nonlinear Equations With Applications

ABSTRACT In this paper, based on the famous inexact Newton method and the inertial‐relaxed technique, we propose an inertial‐relaxed Newton‐type projection method for solving nonlinear equations. The global convergence of the proposed method is established without the Lipschitz continuity and pseudo‐monotonicity of the underlying mapping. Moreover, under the local Lipschitz continuity, we show the iteration‐complexity bound for finding an ‐approximation solution with being a given precision. To the best of our knowledge, this is the first iteration‐complexity result associated with Newton‐type projection methods in the literature under such an assumption. Preliminary numerical experiments on standard nonlinear equations show that the proposed method is competitive and promising. Applying the proposed method to solving Tikhonov‐regularized logistic regression problems verifies the efficiency and robustness of the proposed method.

Authors

Institutions

Publication Details

Journal
Numerical Linear Algebra with Applications
Published
2026-02-01
DOI
https://doi.org/10.1002/nla.70067
Primary Topic
Numerical methods in inverse problems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Inertial‐Relaxed Newton‐Type Projection Method for Solving Nonlinear Equations With Applications

Y. Charles Li, Jianghua Yin, Dan Jian
Numerical Linear Algebra with Applications
Numerical methods in inverse problems
article

An Inertial‐Relaxed Newton‐Type Projection Method for Solving Nonlinear Equations With Applications

Y. Charles Li, Jianghua Yin, Dan Jian
article en

Abstract

ABSTRACT In this paper, based on the famous inexact Newton method and the inertial‐relaxed technique, we propose an inertial‐relaxed Newton‐type projection method for solving nonlinear equations. The global convergence of the proposed method is established without the Lipschitz continuity and pseudo‐monotonicity of the underlying mapping. Moreover, under the local Lipschitz continuity, we show the iteration‐complexity bound for finding an ‐approximation solution with being a given precision. To the best of our knowledge, this is the first iteration‐complexity result associated with Newton‐type projection methods in the literature under such an assumption. Preliminary numerical experiments on standard nonlinear equations show that the proposed method is competitive and promising. Applying the proposed method to solving Tikhonov‐regularized logistic regression problems verifies the efficiency and robustness of the proposed method.

Numerical Linear Algebra with ApplicationsVol. 33(1)
Guangxi University (CN)
Openalex Percentile: Top 50%
Numerical methods in inverse problems
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.