應用於最佳控制問題的三階段解耦預處理全空間拉格朗日牛頓方法;A three-stage decoupling preconditioned full-space Lagrange-Newton method for optimal control problems

NCU Institutional Repository > 理學院 > 數學研究所 > 博碩士論文 > Item 987654321/85098

請使用永久網址來引用或連結此文件: http://ir.lib.ncu.edu.tw/handle/987654321/85098

題名:	應用於最佳控制問題的三階段解耦預處理全空間拉格朗日牛頓方法;A three-stage decoupling preconditioned full-space Lagrange-Newton method for optimal control problems
作者:	馬天昊;Ma, Tian-hao
貢獻者:	數學系
關鍵詞:	預處理;全空間拉格朗日牛頓方法;最佳控制問題;precondition;full-space Lagrange-Newton method;optimal control problems
日期:	2021-01-27
上傳時間:	2021-03-18 17:39:40 (UTC+8)
出版者:	國立中央大學
摘要:	本文旨在研究一種用於求解非線性最佳控制問題的全空間拉格朗日-牛頓算法。這類問題在計算科學和工程中的應用十分廣泛，例如軌道最佳化問題，工業機器人問題等，這些問題也可以用數學公式轉化為等式約束優化問題。在此方法中，第一步是將拉格朗日乘數引入目標函數從而得到拉格朗日函數，然後通過牛頓類方法找到一階必要性最優條件（也稱為 KKT 條件）的臨界解，從而解決最佳化問題。牛頓型方法的優點之一是收斂快速，前提是初始猜測足夠接近解。但是，通常很難獲得如此好的初始猜測。當系統的非線性不平衡時，即使使用某些全局更新的技術，牛頓法也存在收斂問題。拉格朗日-牛頓方法的缺點之一是需要構造 KKT 矩陣。KKT 系統的黑塞矩陣的計算可能非常昂貴，例如使用有限差分近似法。為了提高牛頓方法的魯棒性，我們提出了一種新的三級去耦預處理器。新算法的關鍵是在執行全局牛頓更新之前，在三級解耦預處理階段，我們按順序校正拉格朗日乘數，控制變量和狀態變量。基於幾個基準測試問題的數值結果表明，三級解耦預處理器有助於拉格朗日-牛頓算法的收斂，並可以減少迭代次數。此外，我們報告了一系列比較研究，以研究採用全空間方法構建黑塞矩陣的不同方法，包括解析方法，有限差分，自動微分和基於低秩更新的方法。我們還通過數字顯示，全空間方法比 Matlab 工具箱中的優化器快數百倍，後者是使用縮減空間的拉格朗日-牛頓方法實現的。;This thesis aims to study a full-space Lagrange-Newton algorithm for solving nonlinear optimal control problems. These problems represent a wide range of applications in computational science and engineering, such as trajectory optimization problems, industrial robots problems that can be also mathematically formulated as equality-constrained optimization problems. In this method, the first step is to introduce the Lagrange multiplier into the objective function and then solve the optimization problem by finding the critical solution of the first-order necessary optimality condition (also known as the KKT condition) by the Newton-type method. One of the advantages of the Newton-type method is fast convergence provided that an initial guess is close to the solution. However, such a good initial guess is not easy to obtain. And Newton′s method suffers from the convergence issue when the nonlinearity of the system is not well balanced even some globalization technique is used. One of the drawbacks of the Lagrange-Newton method is that the KKT matrix needs to construct. The computation of the Hessian matrix of the KKT system could be expensive for example using finite-difference approximation. To improve the robustness of Newton′s method, we propose a new three-stage decoupling preconditioner. The key point of the new proposed algorithm is that before performing the global Newton update, in the three-stage decoupling preconditioning phase, we correct the Lagrange multiplier, control variables, state variables in order. Our numerical results based on several benchmark test problems show that the three-stage decoupling preconditioner helpful for the convergence of the Lagrange-Newton algorithm and can reduce the number of iterations. Besides, we report a series of comparative study to investigate the full-space method with different approaches for constructing the Hessian matrix, including analytical approach, finite differences, automatic differentiation, and the low-rank update based method. We also show numerically that the full-space method is about a few hundred times faster than an optimizer in Matlab toolbox, which is implemented using the reduced-space Lagrange-Newton method.
顯示於類別:	[數學研究所] 博碩士論文

文件中的檔案:

檔案	描述	大小	格式	瀏覽次數
index.html		0Kb	HTML	155	檢視/開啟

在NCUIR中所有的資料項目都受到原著作權保護.

社群 sharing

資料載入中.....