24小时热门版块排行榜    

查看: 1500  |  回复: 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.
回复此楼

» 猜你喜欢

» 本主题相关价值贴推荐,对您同样有帮助:

已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖

tllijp

金虫 (正式写手)

【答案】应助回帖

感谢参与,应助指数 +1
tmy1977(金币+50): ★★★★★最佳答案 谢谢.看来是进去了! 2012-02-14 19:37:35
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
被引用数: 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.
2楼2012-02-14 19:29:00
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖

tllijp

金虫 (正式写手)

【答案】应助回帖

标题: 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
被引频次: 0 (来自 Web of Science)
3楼2012-02-14 19:31:51
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖

slimmy

新虫 (正式写手)

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 ]     引证关系图      
摘要: 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  
作者关键词: 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  
基金资助致谢:
基金资助机构 授权号
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  
学科类别: Mathematics  
IDS 号: 806ZW  
ISSN: 1009-6124
4楼2012-02-14 20:33:48
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖
相关版块跳转 我要订阅楼主 tmy1977 的主题更新
最具人气热帖推荐 [查看全部] 作者 回/看 最后发表
[基金申请] 哪位高人中了,把查询到的截图贴出来让我看看,让我长长见识 +6 yuleib84 2026-08-26 7/350 2026-08-31 19:46 by 鱼翔浅底1
[基金申请] 能否申诉? +7 echo8914667 2026-08-30 8/400 2026-08-31 17:00 by yihongxu
[基金申请] 中青基了要发朋友圈吗? +7 349506619 2026-08-28 7/350 2026-08-31 13:39 by 冼亮淀粉酶
[基金申请] 国社科又开始会评了,不知道这次命运如何 +6 雨打竹帘 2026-08-30 10/500 2026-08-31 09:29 by huixian257
[基金申请] 基金不中,共勉 +12 eulota 2026-08-26 12/600 2026-08-31 08:42 by ZJTJZ
[基金申请] 有没有仍没收到信息的 +7 德尚中行 2026-08-27 8/400 2026-08-30 20:52 by purplejack
[基金申请] 麻烦专家们看看评委们的意见(F口面上) +6 gdd2018 2026-08-28 11/550 2026-08-30 08:58 by 超级无敌华子
[基金申请] 怎么查啊 +6 huang1991js 2026-08-26 6/300 2026-08-28 08:42 by winsaint
[基金申请] 面上合作单位盖章 +5 ssyjh 2026-08-27 5/250 2026-08-27 20:50 by gdfollow
[基金申请] 基金未中,这种答复是模板吗? +5 zhaosm1982 2026-08-27 6/300 2026-08-27 16:00 by lfy8008
[基金申请] 看板上这么多中的,有点像50人群里49个人都是骗子的那种感觉…… +5 a089 2026-08-26 6/300 2026-08-27 14:05 by jonewore
[基金申请] 为什么 国际(地区)合作与交流项目 没有放榜? 10+3 majunge000 2026-08-26 11/550 2026-08-27 08:42 by 北京莱茵编辑
[基金申请] 我不理解! +15 Edward_pc 2026-08-26 23/1150 2026-08-26 20:34 by zzuzxg
[基金申请] 2026年8月25日国自然放榜前突然收到列入评审专家邮件,有关系吗? +25 木水思豆 2026-08-25 28/1400 2026-08-26 14:53 by draco1987
[基金申请] 出来了 +9 trojank 2026-08-26 9/450 2026-08-26 14:25 by 宝贝虫子
[基金申请] 为什么国自然不能直接公布 +4 bjdxyxy 2026-08-26 4/200 2026-08-26 13:12 by qingmu1201
[基金申请] 国合里面能看到了 +7 一怀馨秋 2026-08-26 7/350 2026-08-26 11:23 by zhaosm1982
[基金申请] 国合可查了 +3 paperzjh 2026-08-26 3/150 2026-08-26 10:41 by LemmonTr
[基金申请] 牛来!米来!面来! +8 beefly 2026-08-26 8/400 2026-08-26 08:37 by xuzhipiao
[基金申请] 某些机构,以效率低为荣,以效率低作为存在感 +9 yuleib84 2026-08-25 10/500 2026-08-25 17:14 by alexon
信息提示
请填处理意见