Responsive image
博碩士論文 etd-0630113-233126 詳細資訊
Title page for etd-0630113-233126
論文名稱
Title
約束極小化之迭代梯度方法
Iterative gradient methods for constrained minimization
系所名稱
Department
畢業學年期
Year, semester
語文別
Language
學位類別
Degree
頁數
Number of pages
19
研究生
Author
指導教授
Advisor
召集委員
Convenor
口試委員
Advisory Committee
口試日期
Date of Exam
2013-07-08
繳交日期
Date of Submission
2013-07-31
關鍵字
Keywords
收斂性、梯度投影法、約束極小化、投影、收縮映射、非擴張映射、迭代、演算法、固定點
projection, gradient projection method, iteration, algorithm, fixed point, convergence, constrained minimization, contraction, nonexpansive mapping
統計
Statistics
本論文已被瀏覽 5818 次,被下載 858
The thesis/dissertation has been browsed 5818 times, has been downloaded 858 times.
中文摘要
這篇論文中,我們探討強凸函數在某非擴張映射之固定點集合上的極小化問題,我們使用正則化的技巧,並引用隱式和顯式兩種迭代方法求解唯一極小點,我們證明了兩種方法的強收斂性,我們的方法推廣了求解約束最佳化問題的梯度投影法。
Abstract
In this paper we deal with the problem of minimizing a strongly convex objective function over the set of fixed points of a nonexpansive mapping T. This extends the constrained strongly convex minimization problem over a closed convex subset C of a Hilbert space since the projection Pc is nonexpansive. By introducing a parameter λ>0 , we define a family of contractions Tλ, each of which has a unique fixed point denoted as ξλ. We first prove that as λ→0, ξλ converges in norm to the unique solution of our minimization problem. We then introduce an iteration algorithm by discretization of the mappings Tλ, and prove strong convergence of this algorithm under appropriate conditions imposed on the sequence of parameters of the algorithm.
目次 Table of Contents
1. Introduction ------- 1
2. Preliminaries ----- 4
3. Main Results ----- 6
References ------- 13
參考文獻 References
[1] Juan Peypouquet, Coupling the Gradient Method with a General Exterior Penalization Scheme for Convex Minimization, J Optim Theory Appl. 153 (2012), 123-138.
[2] John G. O'Hara, Paranjothi Pillay and Hong-Kun Xu, Iterative Approaches to Convex Minimization Problems, Numerical Functional Analysis and Optimization. 25(5&6) (2004), 531-546.
[3] O'Hara, J. G., Pillay, P. and Hong-Kun Xu, Iterative approaches to finding nearest common fixed points of nonexpansive mappings in Hilbert spaces, Nonlinear Anal. 54 (2003), 1417-1426.
[4] Hong-Kun Xu, An iterative approach to quadratic optimization, J. Optimiz. Theory Appl. 116 (2003), 659-678.
[5] Halpern, B., Fixed points of nonexpanding maps, Bull. Amer. Math. Soc. 73 (1967), 957-961.
[6] Wittmann, R., Approximation of fixed points of nonexpansive mappings, Arch. Math. 58 (1992), 486-491.
[7] Bauschke, H., The appoximation of fixed points of compositions of nonexpansive mappings in Hilbert space, J. Math. Anal. Appl. 202 (1996), 150-159.
[8] Deutsch, F., Yamada, I., Minimizing certain convex functions over the intersection of the fixed point sets of nonexpansive mappings, Numer. Funct. Anal. Optim. 19(1&2) (1998), 33-56.
[9] Yamada, I., Ogura, N., Yamashita, Y., Sakaniwa, K., Quadratic approximation of fixed points of nonexpansive mappings in Hilbert spaces, Numer. Funct. Anal. Optimiz. 19(1) (1998), 165-190.
電子全文 Fulltext
本電子全文僅授權使用者為學術研究之目的,進行個人非營利性質之檢索、閱讀、列印。請遵守中華民國著作權法之相關規定,切勿任意重製、散佈、改作、轉貼、播送,以免觸法。
論文使用權限 Thesis access permission:自定論文開放時間 user define
開放時間 Available:
校內 Campus: 已公開 available
校外 Off-campus: 已公開 available


紙本論文 Printed copies
紙本論文的公開資訊在102學年度以後相對較為完整。如果需要查詢101學年度以前的紙本論文公開資訊,請聯繫圖資處紙本論文服務櫃台。如有不便之處敬請見諒。
開放時間 available 已公開 available

QR Code