中大機構典藏-NCU Institutional Repository-提供博碩士論文、考古題、期刊論文、研究計畫等下載:Item 987654321/95762
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 80990/80990 (100%)
Visitors : 42678080      Online Users : 1244
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version


    Please use this identifier to cite or link to this item: http://ir.lib.ncu.edu.tw/handle/987654321/95762


    Title: 擬牛頓法在非線性最小平方、對稱非線性方程組和最近似相關矩陣問題的應用;A family of quasi-Newton methods for solving nonlinear least-squares, symmetric nonlinear equations, and the nearest correlation matrix problems
    Authors: 黃德國;Quoc, Huynh Duc
    Contributors: 數學系
    Keywords: 非線;問題;方法;牛頓法;角色;Newton method;nonlinear;least squares;matrix;correlation
    Date: 2024-07-23
    Issue Date: 2024-10-09 17:15:24 (UTC+8)
    Publisher: 國立中央大學
    Abstract: 本論文探討無約束最佳化問題及其特殊形式,如非線性最小平方問題和非線性對稱方程求解,這些問題在數值最佳化中扮演重要角色,在現實世界中有許多應用。

    為了解決這些最佳化挑戰,存在多種方法。本論文研究了一組擬牛頓法,這是一類用於解決這些問題的迭代技術,並展示了它們相較於傳統最佳化方法如最速下降法和牛頓法的優勢。擬牛頓法僅利用梯度評估來逼近包含目標函數二階信息的Hessian矩陣。這種逼近顯著減少了計算成本和複雜性,使擬牛頓法對於計算精確Hessian矩陣不可行的大規模問題尤為吸引。

    使用類割線的對角矩陣近似,擬牛頓法為各種優化問題提供了高效的解決方案,展示了它們在不同情境下的有效性。這些方法在適當條件下還具有全局收斂性。;This thesis aims to develop an efficient solution algorithm for the unconstrained optimization problem and its special cases, including nonlinear least-squares and nonlinear equations, which hold substantial importance in numerical optimization with numerous practical applications. Additionally, by exploring their use in addressing the nearest correlation matrix problems through numerical experiments, this study establishes a foundation for further research and practical implementations in real-world applications.

    Various methods are available to handle these computational challenges. We focus on a family of quasi-Newton methods, a class of iterative techniques for solving these problems. We demonstrate their advantages over traditional optimization methods, such as the steepest descent and Newton′s method. Quasi-Newton methods only use gradient evaluations to approximate the Hessian matrix, which encodes second-order information about the objective function. This approximation significantly reduces computational cost and complexity, making quasi-Newton methods particularly appealing for large-sized problems where calculating the exact Hessian is impractical or impossible.

    Using secant-like diagonal matrix approximations, quasi-Newton methods provide efficient solutions for various optimization problems, demonstrating their effectiveness across diverse scenarios. These methods also exhibit global convergence properties under suitable conditions.
    Appears in Collections:[Graduate Institute of Mathematics] Electronic Thesis & Dissertation

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML43View/Open


    All items in NCUIR are protected by copyright, with all rights reserved.

    社群 sharing

    ::: Copyright National Central University. | 國立中央大學圖書館版權所有 | 收藏本站 | 設為首頁 | 最佳瀏覽畫面: 1024*768 | 建站日期:8-24-2009 :::
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 隱私權政策聲明