scholarly journals An Adaptive Nonmonotone Line Search Technique for Solving Systems of Nonlinear Equations

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.

2018 ◽  
Vol 12 (2) ◽  
pp. 165-176
Author(s):  
Zhujun Wang ◽  
Li Cai ◽  
Zheng Peng

We present a family of new inexact secant methods in association with Armijo line search technique for solving nonconvex constrained optimization. Different from the existing inexact secant methods, the algorithms proposed in this paper need not compute exact directions. By adopting the nonsmooth exact penalty function as the merit function, the global convergence of the proposed algorithms is established under some reasonable conditions. Some numerical results indicate that the proposed algorithms are both feasible and effective.


2012 ◽  
Vol 17 (2) ◽  
pp. 203-216 ◽  
Author(s):  
Gonglin Yuan ◽  
Zengxin Wei

The Barzilai and Borwein gradient algorithm has received a great deal of attention in recent decades since it is simple and effective for smooth optimization problems. Whether can it be extended to solve nonsmooth problems? In this paper, we answer this question positively. The Barzilai and Borwein gradient algorithm combined with a nonmonotone line search technique is proposed for nonsmooth convex minimization. The global convergence of the given algorithm is established under suitable conditions. Numerical results show that this method is efficient.


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.


Sign in / Sign up

Export Citation Format

Share Document