- Generalizations of the limited-memory BFGS method based on the quasi-…
Number of the records: 1  

Generalizations of the limited-memory BFGS method based on the quasi-product form of update

  1. 1.
    SYSNO ASEP0381640
    Document TypeJ - Journal Article
    R&D Document TypeJournal Article
    Subsidiary JČlánek ve WOS
    TitleGeneralizations of the limited-memory BFGS method based on the quasi-product form of update
    Author(s) Vlček, Jan (UIVT-O) SAI, RID, ORCID
    Lukšan, Ladislav (UIVT-O) SAI, RID, ORCID
    Source TitleJournal of Computational and Applied Mathematics. - : Elsevier - ISSN 0377-0427
    Roč. 241, 15 March (2013), s. 116-129
    Number of pages14 s.
    Languageeng - English
    CountryNL - Netherlands
    Keywordsunconstrained minimization ; variable metric methods ; limited-memory methods ; Broyden class updates ; global convergence ; numerical results
    Subject RIVBA - General Mathematics
    R&D ProjectsGA201/09/1957 GA ČR - Czech Science Foundation (CSF)
    CEZAV0Z10300504 - UIVT-O (2005-2011)
    UT WOS000312354100008
    EID SCOPUS84868223108
    DOI https://doi.org/10.1016/j.cam.2012.09.027
    AnnotationTwo families of limited-memory variable metric or quasi-Newton methods for unconstrained minimization based on quasi-product form of update are derived. As for the first family, four variants how to utilize the Strang recurrences for the Broyden class of variable metric updates are investigated; three of them use the same number of stored vectors as the limited- memory BFGS method. Moreover, one of the variants does not require any additional matrix by vector multiplication. The second family uses vectors from the preceding iteration to construct a new class of variable metric updates. Resulting methods again require neither any additional matrix by vector multiplication nor any additional stored vector. Global convergence of four of presented methods is established for convex sufficiently smooth functions. Numerical results indicate that two of the new methods can save computational time substantially for certain problems.
    WorkplaceInstitute of Computer Science
    ContactTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Year of Publishing2013
Number of the records: 1  

Metadata are licenced under CC0

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.