Global convergence of nonmonotone descent methods for unconstrained optimization problems (Q697549): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claims
Property / author
 
Property / author: Wen-Yu Sun / rank
Normal rank
 
Property / author
 
Property / author: Ji-ye Han / rank
Normal rank
 

Revision as of 11:58, 14 February 2024

scientific article
Language Label Description Also known as
English
Global convergence of nonmonotone descent methods for unconstrained optimization problems
scientific article

    Statements

    Global convergence of nonmonotone descent methods for unconstrained optimization problems (English)
    0 references
    0 references
    17 September 2002
    0 references
    This paper deals with global convergence for unconstrained optimization algorithms that utilize a nonmonotone line search procedure. The proposed technique allows the user to specify a flexible facing function and includes Armijo, Goldstein and Wolfe rules as special cases. The global convergence (towards stationary points) of the nonmonotone descent method for unconstrained optimization is proved.
    0 references
    unconstrained optimization
    0 references
    nonmonotone line search
    0 references
    global convergence
    0 references
    algorithms
    0 references

    Identifiers