Enhanced Projection Method for the Solution of the System of Nonlinear Equations Under a More General Assumption than Pseudo-Monotonicity and Lipschitz Continuity

In this manuscript, we propose an efficient algorithm for solving a class of nonlinear operator equations. The algorithm is an improved version of previously established method. The algorithm’s features are as follows: (i) the search direction is bounded and satisfies the sufficient descent condition; (ii) the global convergence is achieved when the operator is continuous and satisfies a condition weaker than pseudo-monotonicity. Moreover, by comparing it with previously established method the algorithm’s efficiency was shown. The comparison was based on the iteration number required for each algorithm to solve a particular problem and the time taken. Some benchmark test problems, which included monotone and pseudo-monotone problems, were considered for the experiments. Lastly, the algorithm was utilized to solve the logistic regression (prediction) model.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2024-11-27
DOI
https://doi.org/10.3390/math12233734
Citations
1
Primary Topic
Advanced Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.73
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Enhanced Projection Method for the Solution of the System of Nonlinear Equations Under a More General Assumption than Pseudo-Monotonicity and Lipschitz Continuity

Kanikar Muangchoo, Auwal Bala Abubakar
1 citations
Mathematics
Advanced Optimization Algorithms Research
0.73
article

Enhanced Projection Method for the Solution of the System of Nonlinear Equations Under a More General Assumption than Pseudo-Monotonicity and Lipschitz Continuity

Kanikar Muangchoo, Auwal Bala Abubakar
article en
1 citations

Abstract

In this manuscript, we propose an efficient algorithm for solving a class of nonlinear operator equations. The algorithm is an improved version of previously established method. The algorithm’s features are as follows: (i) the search direction is bounded and satisfies the sufficient descent condition; (ii) the global convergence is achieved when the operator is continuous and satisfies a condition weaker than pseudo-monotonicity. Moreover, by comparing it with previously established method the algorithm’s efficiency was shown. The comparison was based on the iteration number required for each algorithm to solve a particular problem and the time taken. Some benchmark test problems, which included monotone and pseudo-monotone problems, were considered for the experiments. Lastly, the algorithm was utilized to solve the logistic regression (prediction) model.

MathematicsVol. 12(23)
Sefako Makgatho Health Sciences University (ZA), Rajamangala University of Technology Phra Nakhon (TH), Bayero University Kano (NG)
Openalex Percentile: Top 28%
Advanced Optimization Algorithms Research
0.73
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.

Enhanced Projection Method for the Solution of the System of Nonlinear Equations Under a More General Assumption than Pseudo-Monotonicity and Lipschitz Continuity — Kanikar Muangchoo, Auwal Bala Abubakar · Mathematics (2024) | TGRS Research Map | TGRS