Extra multistep BFGS updates in quasi-Newton methods (Q884227): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: L-BFGS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Family of Variable-Metric Methods Derived by Variational Means / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditioning of Quasi-Newton Methods for Function Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix conditioning and nonlinear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of function-values in unconstrained optimisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the limited memory BFGS method for large scale optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel quasi-Newton methods for unconstrained optimization / 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: Multi-step quasi-Newton methods for optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818806 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:09, 25 June 2024

scientific article
Language Label Description Also known as
English
Extra multistep BFGS updates in quasi-Newton methods
scientific article

    Statements

    Extra multistep BFGS updates in quasi-Newton methods (English)
    0 references
    0 references
    13 June 2007
    0 references
    Summary: This note focuses on developing quasi-Newton methods that combine \(m+1\) multistep and single-step updates on a single iteration for the sake of constructing the new approximation to the Hessian matrix to be used on the next iteration in computing the search direction. The approach considered here exploits the merits of the multistep methods and those of El-Baali (1999) to create a hybrid technique. Our numerical results are encouraging and reveal that our proposed approach is promising. The new methods compete well with El-Baali's extra update algorithms (1999).
    0 references
    0 references
    0 references
    0 references
    0 references