scholarly journals A line search filter approach for the system of nonlinear equations

2008 ◽  
Vol 55 (9) ◽  
pp. 2134-2141 ◽  
Author(s):  
Pu-yan Nie ◽  
Ming-yong Lai ◽  
Shu-jin Zhu ◽  
Pei-ai Zhang
2012 ◽  
Vol 2012 ◽  
pp. 1-15 ◽  
Author(s):  
Zhong Jin ◽  
Yuqing Wang

An improved line search filter algorithm for the system of nonlinear equations is presented. We divide the equations into two groups, one contains the equations that are treated as equality constraints and the square of other equations is regarded as objective function. Two groups of equations are updated at every iteration in the works by Nie (2004, 2006, and 2006), by Nie et al. (2008), and by Gu (2011), while we just update them at the iterations when it is needed indeed. As a consequence, the scale of the calculation is decreased in a certain degree. Under some suitable conditions the global convergence can be induced. In the end, numerical experiments show that the method in this paper is effective.


2012 ◽  
Vol 2012 ◽  
pp. 1-15
Author(s):  
Zhong Jin ◽  
Yuqing Wang

We present a new iterative method based on the line search filter method with the nonmonotone strategy to solve the system of nonlinear equations. The equations are divided into two groups; some equations are treated as constraints and the others act as the objective function, and the two groups are just updated at the iterations where it is needed indeed. We employ the nonmonotone idea to the sufficient reduction conditions and filter technique which leads to a flexibility and acceptance behavior comparable to monotone methods. The new algorithm is shown to be globally convergent and numerical experiments demonstrate its effectiveness.


Author(s):  
M. Y. Waziri ◽  
Z. A. Majid

Diagonal updating scheme is among the cheapest Newton-like methods for solving system of nonlinear equations. Nevertheless, the method has some shortcomings. In this paper, we proposed an improved matrix-free secant updating scheme via line search strategies, by using the steps of backtracking in the Armijo-type line search as a step length predictor and Wolfe-Like condition as corrector. Our approach aims at improving the overall performance of diagonal secant updating scheme. Under mild assumptions, the global convergence results have been presented. Numerical experiments verify that the proposed approach is very promising.


2021 ◽  
Vol 2021 ◽  
pp. 1-6
Author(s):  
Masoud Hatamian ◽  
Mahmoud Paripour ◽  
Farajollah Mohammadi Yaghoobi ◽  
Nasrin Karamikabir

In this article, a new nonmonotone line search technique is proposed for solving a system of nonlinear equations. We attempt to answer this question how to control the degree of the nonmonotonicity of line search rules in order to reach a more efficient algorithm? Therefore, we present a novel algorithm that can avoid the increase of unsuccessful iterations. For this purpose, we show the robust behavior of the proposed algorithm by solving a few numerical examples. Under some suitable assumptions, the global convergence of our strategy is proved.


2020 ◽  
Vol 30 (4) ◽  
pp. 399-412
Author(s):  
Abubakar Halilu ◽  
Mohammed Waziri ◽  
Ibrahim Yusuf

We proposed a matrix-free direction with an inexact line search technique to solve system of nonlinear equations by using double direction approach. In this article, we approximated the Jacobian matrix by appropriately constructed matrix-free method via acceleration parameter. The global convergence of our method is established under mild conditions. Numerical comparisons reported in this paper are based on a set of large-scale test problems and show that the proposed method is efficient for large-scale problems.


2019 ◽  
Vol 10 (4) ◽  
pp. 877-886 ◽  
Author(s):  
Chhavi Mangla ◽  
Musheer Ahmad ◽  
Moin Uddin

Sign in / Sign up

Export Citation Format

Share Document