A Derivative-Free Method with the Symmetric Rank-One Update for Constrained Nonlinear Systems of Monotone Equations

This paper presents a new derivative-free method with a symmetric rank-one (SR1) update for handling constrained nonlinear systems of monotone equations. Distinctively, the approach employs a revised SR1 update formula that leverages information from the latest three iterates and their corresponding function values—a key improvement over existing SR1 variants relying only on two-point information. Derived from this revised formula, the approach integrates projection techniques for performance enhancement. One of its key advantages lies in the search direction: it exhibits sufficient descent and trust-region properties while eliminating the need for line search techniques. Theoretical analysis shows that the algorithm converges globally under specified conditions. Furthermore, numerical experiments are conducted to compare the proposed algorithm with two other existing approaches; results demonstrate that it exhibits superior reliability and robustness in terms of the number of iterations, function evaluations, and CPU runtime.

Authors

Institutions

Publication Details

Journal
Symmetry
Published
2025-11-14
DOI
https://doi.org/10.3390/sym17111956
Primary Topic
Advanced Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Derivative-Free Method with the Symmetric Rank-One Update for Constrained Nonlinear Systems of Monotone Equations

Xiaowei Fang
Symmetry
Advanced Optimization Algorithms Research
article

A Derivative-Free Method with the Symmetric Rank-One Update for Constrained Nonlinear Systems of Monotone Equations

Xiaowei Fang
article en

Abstract

This paper presents a new derivative-free method with a symmetric rank-one (SR1) update for handling constrained nonlinear systems of monotone equations. Distinctively, the approach employs a revised SR1 update formula that leverages information from the latest three iterates and their corresponding function values—a key improvement over existing SR1 variants relying only on two-point information. Derived from this revised formula, the approach integrates projection techniques for performance enhancement. One of its key advantages lies in the search direction: it exhibits sufficient descent and trust-region properties while eliminating the need for line search techniques. Theoretical analysis shows that the algorithm converges globally under specified conditions. Furthermore, numerical experiments are conducted to compare the proposed algorithm with two other existing approaches; results demonstrate that it exhibits superior reliability and robustness in terms of the number of iterations, function evaluations, and CPU runtime.

SymmetryVol. 17(11)
Huzhou Normal University (CN)
Openalex Percentile: Top 51%
Advanced Optimization Algorithms Research
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.