Number of the records: 1  

A Hybrid Method for Nonlinear Least Squares that Uses Quasi-Newton Updates Applied to an Approximation of the Jacobian Matrix

  1. 1.
    SYSNO ASEP0497192
    Document TypeC - Proceedings Paper (int. conf.)
    R&D Document TypeConference Paper
    TitleA Hybrid Method for Nonlinear Least Squares that Uses Quasi-Newton Updates Applied to an Approximation of the Jacobian Matrix
    Author(s) Lukšan, Ladislav (UIVT-O) SAI, RID
    Vlček, Jan (UIVT-O) SAI, RID, ORCID
    Source TitlePrograms and Algorithms of Numerical Mathematics 19. - Prague : Institute of Mathematics of the Czech Academy of Sciences, 2019 / Chleboun J. ; Kůs P. ; Přikryl P. ; Rozložník M. ; Segeth K. ; Šístek J. ; Vejchodský T. - ISBN 978-80-85823-69-1
    Pagess. 99-106
    Number of pages8 s.
    Publication formOnline - E
    ActionPrograms and Algorithms of Numerical Mathematics /19./
    Event date24.06.2018 - 29.06.2018
    VEvent locationHejnice
    CountryCZ - Czech Republic
    Event typeWRD
    Languageeng - English
    CountryCZ - Czech Republic
    Keywordsnonlinear least squares ; hybrid methods ; trust-region methods ; quasi-Newton methods ; numerical algorithms ; numerical experiments
    Subject RIVBA - General Mathematics
    OECD categoryApplied mathematics
    Institutional supportUIVT-O - RVO:67985807
    UT WOS000576737400011
    DOI10.21136/panm.2018.11
    AnnotationIn this contribution, we propose a new hybrid method for minimization of nonlinear least squares. This method is based on quasi-Newton updates, applied to an approximation A of the Jacobian matrix J, such that AT f = JT f. This property allows us to solve a linear least squares problem, minimizing ∥Ad+f∥ instead of solving the normal equation ATAd+JT f = 0, where d ∈ Rn is the required direction vector. Computational experiments confirm the efficiency of the new method.
    WorkplaceInstitute of Computer Science
    ContactTereza Šírová, sirova@cs.cas.cz, Tel.: 266 053 800
    Year of Publishing2020
Number of the records: 1  

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