2019
DOI: 10.1007/s11075-019-00772-0
|View full text |Cite
|
Sign up to set email alerts
|

On the global convergence of an inexact quasi-Newton conditional gradient method for constrained nonlinear systems

Abstract: In this paper, we propose a globally convergent method for solving constrained nonlinear systems. The method combines an efficient Newton conditional gradient method with a derivativefree and nonmonotone linesearch strategy. The global convergence analysis of the proposed method is established under suitable conditions, and some preliminary numerical experiments are given to illustrate its performance.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
2
0

Year Published

2020
2020
2021
2021

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 36 publications
(76 reference statements)
0
2
0
Order By: Relevance
“…They are particularly attractive when the Jacobian matrix of F is not available analytically or its computation is burdensome. Indeed, distinguishing features of these methods are that the computation of the search directions does not involve the solution of linear systems, and that effective derivative-free linesearch conditions can be defined [6,7,11,12,15]. The paper is organized as follows.…”
Section: Introductionmentioning
confidence: 99%
“…They are particularly attractive when the Jacobian matrix of F is not available analytically or its computation is burdensome. Indeed, distinguishing features of these methods are that the computation of the search directions does not involve the solution of linear systems, and that effective derivative-free linesearch conditions can be defined [6,7,11,12,15]. The paper is organized as follows.…”
Section: Introductionmentioning
confidence: 99%
“…Intuitively, large values of η k allow a highly nonmonotone behaviour of F k while small values of η k promote the decrease of F . Several linesearch strategies in the literature fall in this scheme [19,28,31,34]. The main idea is that, given x k , the steps take the form…”
mentioning
confidence: 99%