The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions (Q928232): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q385194
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Zeng-xin Wei / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ve08 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10114-007-1012-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1964934933 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4776780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4107408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of the Variable Metric Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über die globale Konvergenz von Variable-Metrik-Verfahren mit nicht- exakter Schrittweitenbestimmung / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergece of the bfgs algorithm with nonmonotone linesearch<sup>∗</sup><sup>∗</sup>this work is supported by national natural science foundation$ef: / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4382889 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The global convergence of self-scaling BFGS algorithm with non-monotone line search for unconstrained nonconvex optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of the Broyden's class of quasi-Newton methods with nonmonotone linesearch / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified BFGS method and its global convergence in nonconvex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Unconstrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: New quasi-Newton methods for unconstrained optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An SQP-type method and its application in stochastic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The superlinear convergence of a modified BFGS-type method for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended global convergence framework for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence analysis of a new nonmonotone BFGS algorithm on convex objective functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local convergence analysis for partitioned quasi-Newton updates / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Local and Superlinear Convergence of Quasi-Newton Methods / rank
 
Normal rank

Latest revision as of 10:41, 28 June 2024

scientific article
Language Label Description Also known as
English
The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions
scientific article

    Statements

    The superlinear convergence analysis of a nonmonotone BFGS algorithm on convex objective functions (English)
    0 references
    0 references
    0 references
    11 June 2008
    0 references
    The principal aim of this article is to establish the superlinear convergence of the nonmonotone Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm proposed by \textit{J. Han} and \textit{G. Liu} [Comput. Optim. Appl. 7, No. 3, 277--289 (1997; Zbl 0876.90072)] for the numerical solution of unconstrained convex optimization problems, under appropriate assumptions.
    0 references
    unconstrained convex optimization
    0 references
    nonmonotone line search
    0 references
    superlinear convergence
    0 references
    0 references
    0 references
    0 references

    Identifiers