| 4 | 1/1 | 返回列表 |
| 查看: 1312 | 回復(fù): 3 | ||
tmy1977金蟲 (正式寫手)
|
[求助]
請哪位朋友幫忙查一下下面這篇文章是否被Sci檢索?謝謝!
|
|
1. 題名: A new descent memory gradient method and its global convergence 2. 作者: Min Sun and Qingguo Bai 3. 期刊題名: Journal of Systems Science and Complexity 4. 出版社: Springer 5. 年份: 2011年 6. 卷期和頁碼: Volume 24, Number 4, 784-794. |
金蟲 (正式寫手)
|
1. タイトル: A new descent memory gradient method and its global convergence 著者名: Sun Min; Bai Qingguo ジャーナル名: JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY 巻: 24 號: 4 ページ: 784-794 DOI: 10.1007/s11424-011-8150-0 発行: AUG 2011 被引用數(shù): 0 (Web of Science から) [ 抄録を非表示] In this article, a new descent memory gradient method without restarts is proposed for solving large scale unconstrained optimization problems. The method has the following attractive properties: 1) The search direction is always a sufficiently descent direction at every iteration without the line search used; 2) The search direction always satisfies the angle property, which is independent of the convexity of the objective function. Under mild conditions, the authors prove that the proposed method has global convergence, and its convergence rate is also investigated. The numerical results show that the new descent memory method is efficient for the given test problems. |
金蟲 (正式寫手)
新蟲 (正式寫手)
|
CSDL Union NCL OPAC (0) 保存為: 更多選項 A new descent memory gradient method and its global convergence 作者: Sun, M (Sun, Min)1; Bai, QG (Bai, Qingguo)2 來源出版物: JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY 卷: 24 期: 4 頁: 784-794 DOI: 10.1007/s11424-011-8150-0 出版年: AUG 2011 被引頻次: 0 (來自 Web of Science) 引用的參考文獻: 18 [ 查看 Related Records ] 引證關(guān)系圖 摘要: In this article, a new descent memory gradient method without restarts is proposed for solving large scale unconstrained optimization problems. The method has the following attractive properties: 1) The search direction is always a sufficiently descent direction at every iteration without the line search used; 2) The search direction always satisfies the angle property, which is independent of the convexity of the objective function. Under mild conditions, the authors prove that the proposed method has global convergence, and its convergence rate is also investigated. The numerical results show that the new descent memory method is efficient for the given test problems. 入藏號: WOS:000293858300014 文獻類型: Article 語種: English 作者關(guān)鍵詞: Global convergence; memory gradient method; sufficiently descent KeyWords Plus: LINE SEARCH; CONJUGATE 通訊作者地址: Sun, M (通訊作者),Zaozhuang Univ, Dept Math & Informat Sci, Zaozhuang 277160, Peoples R China 地址: 1. Zaozhuang Univ, Dept Math & Informat Sci, Zaozhuang 277160, Peoples R China 2. Qufu Normal Univ, Sch Management, Rizhao 276826, Peoples R China 電子郵件地址: sunmin_2008@yahoo.com.cn, qfnubaiqg@163.com 基金資助致謝: 基金資助機構(gòu) 授權(quán)號 National Science Foundation of China 70971076 Foundation of Shandong Provincial Education Department J10LA59 [顯示基金資助信息][隱藏基金資助信息] This research is supported by the National Science Foundation of China under Grant No. 70971076 and the Foundation of Shandong Provincial Education Department under Grant No. J10LA59. 出版商: SPRINGER HEIDELBERG, TIERGARTENSTRASSE 17, D-69121 HEIDELBERG, GERMANY Web of Science 分類: Mathematics, Interdisciplinary Applications 學(xué)科類別: Mathematics IDS 號: 806ZW ISSN: 1009-6124 |
| 4 | 1/1 | 返回列表 |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |
|
百度網(wǎng)盤 |
360云盤 |
千易網(wǎng)盤 |
華為網(wǎng)盤
在新窗口頁面中打開自己喜歡的網(wǎng)盤網(wǎng)站,將文件上傳后,然后將下載鏈接復(fù)制到帖子內(nèi)容中就可以了。 |
| 最具人氣熱帖推薦 [查看全部] | 作者 | 回/看 | 最后發(fā)表 | |
|---|---|---|---|---|
|
[考研] 一志愿重慶大學(xué)085700資源與環(huán)境總分308求調(diào)劑 +6 | 墨墨漠 2026-03-20 | 6/300 |
|
|---|---|---|---|---|
|
[考研] 070300化學(xué)319求調(diào)劑 +7 | 錦鯉0909 2026-03-17 | 7/350 |
|
|
[考研] 299求調(diào)劑 +6 | △小透明* 2026-03-17 | 6/300 |
|
|
[考研] 083200學(xué)碩321分一志愿暨南大學(xué)求調(diào)劑 +3 | innocenceF 2026-03-17 | 3/150 |
|
|
[考研] 一志愿西南交大,求調(diào)劑 +5 | 材化逐夢人 2026-03-18 | 5/250 |
|
|
[考研] 311求調(diào)劑 +5 | 冬十三 2026-03-18 | 5/250 |
|
|
[考研] 22408 344分 求調(diào)劑 一志愿 華電計算機技術(shù) +4 | solanXXX 2026-03-20 | 4/200 |
|
|
[考研] 一志愿南昌大學(xué),327分,材料與化工085600 +9 | Ncdx123456 2026-03-19 | 9/450 |
|
|
[考研]
|
然11 2026-03-19 | 4/200 |
|
|
[考研]
|
簡木ChuFront 2026-03-19 | 8/400 |
|
|
[考研] 353求調(diào)劑 +3 | 拉鉤不許變 2026-03-20 | 3/150 |
|
|
[考研] 求調(diào)劑 +3 | @taotao 2026-03-20 | 3/150 |
|
|
[考研] 招收調(diào)劑碩士 +4 | lidianxing 2026-03-19 | 12/600 |
|
|
[考研] 能源材料化學(xué)課題組招收碩士研究生8-10名 +5 | 脫穎而出 2026-03-16 | 14/700 |
|
|
[考研] 266求調(diào)劑 +5 | 陽陽哇塞 2026-03-14 | 10/500 |
|
|
[考研] 一志愿西安交通大學(xué)材料工程專業(yè) 282分求調(diào)劑 +5 | 楓橋ZL 2026-03-18 | 7/350 |
|
|
[考研] 0703化學(xué)調(diào)劑 +3 | 妮妮ninicgb 2026-03-17 | 3/150 |
|
|
[考研] [導(dǎo)師推薦]西南科技大學(xué)國防/材料導(dǎo)師推薦 +3 | 尖角小荷 2026-03-16 | 6/300 |
|
|
[考研] 321求調(diào)劑 +5 | 大米飯! 2026-03-15 | 5/250 |
|
|
[考研] 26考研一志愿中國石油大學(xué)(華東)305分求調(diào)劑 +3 | 嘉年新程 2026-03-15 | 3/150 |
|