2014
DOI: 10.1090/s0025-5718-2014-02847-0
|View full text |Cite
|
Sign up to set email alerts
|

A dwindling filter line search method for unconstrained optimization

Abstract: In this paper, we propose a new dwindling multidimensional filter second-order line search method for solving large-scale unconstrained optimization problems. Usually, the multidimensional filter is constructed with a fixed envelope, which is a strict condition for the gradient vectors. A dwindling multidimensional filter technique, which is a modification and improvement of the original multidimensional filter, is presented. Under some reasonable assumptions, the new algorithm is globally convergent to a seco… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(1 citation statement)
references
References 35 publications
0
1
0
Order By: Relevance
“…There are many methods for solving the following unconstrained optimization problem normalminnormalxRnf(x) where f ( x ) is a smooth cost function. Among them the line search methods [15,16,17] and trust region methods [18,19,20] are the most popular ones. Levenberg-Marquardt (LM) optimization with trust region method makes a good trade-off between the steepest decent method and the Gauss-Newton method which is widely used in nonlinear optimization [21,22].…”
Section: Introductionmentioning
confidence: 99%
“…There are many methods for solving the following unconstrained optimization problem normalminnormalxRnf(x) where f ( x ) is a smooth cost function. Among them the line search methods [15,16,17] and trust region methods [18,19,20] are the most popular ones. Levenberg-Marquardt (LM) optimization with trust region method makes a good trade-off between the steepest decent method and the Gauss-Newton method which is widely used in nonlinear optimization [21,22].…”
Section: Introductionmentioning
confidence: 99%