Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Numerical Linear Alg...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Numerical Linear Algebra with Applications
Article . 2026 . Peer-reviewed
License: Wiley Online Library User Agreement
Data sources: Crossref
addClaim

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

Authors: Jianghua Yin; Yaobiao Li; Dan Jian; Xianzhen Jiang;

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

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.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    1
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Average
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
1
Top 10%
Average
Average
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!