24小时热门版块排行榜    

查看: 1442  |  回复: 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 的主题更新
最具人气热帖推荐 [查看全部] 作者 回/看 最后发表
[论文投稿] 售SCI一区T0P文章,我:8.O.55.1.O.5.4,科目全,可+急 +3 jRl3mE6ddZGq 2026-08-03 7/350 2026-08-04 04:50 by k7OM8YghWbkC
[硕博家园] 售SCI一区T0P文章,我:8.O.55.1.O.54,科目齐全,可+急 +3 jRl3mE6ddZGq 2026-08-03 6/300 2026-08-04 04:47 by k7OM8YghWbkC
[找工作] 售SCI一区文章,我:8.O.551.O.5.4,科目全,可伽急 +3 cu9Nq1xK233Z 2026-08-03 8/400 2026-08-04 04:47 by k7OM8YghWbkC
[博后之家] 售SCI一区文章,我:8O5.5.1.O5.4,科目全,可伽急 +3 cu9Nq1xK233Z 2026-08-03 8/400 2026-08-04 04:46 by k7OM8YghWbkC
[公派出国] 售SCI一区文章,我:8.O.551.O.5.4,科目全,可伽急 +3 cu9Nq1xK233Z 2026-08-03 7/350 2026-08-04 04:46 by k7OM8YghWbkC
[考博] 售SCI一区T0P文章,我:8.O55.1.O.54,科目全,可十急 +3 cu9Nq1xK233Z 2026-08-03 5/250 2026-08-04 04:44 by k7OM8YghWbkC
[教师之家] 售SCI一区文章,我:8.O.551.O.5.4,科目全,可伽急 +4 cu9Nq1xK233Z 2026-08-03 8/400 2026-08-04 04:41 by k7OM8YghWbkC
[有机交流] 一个有机合成实验室都需要哪些设备? 50+3 kf2781974 2026-07-31 9/450 2026-08-04 03:56 by kf2781974
[教师之家] 售SCI一区文章,我:8O5.5.1.O5.4,科目全,可伽急 +3 jRl3mE6ddZGq 2026-08-03 7/350 2026-08-04 03:35 by k7OM8YghWbkC
[考研] 售SCI一区文章,我:8.O.55.1.O.54,科目齐全,可伽急 +3 cu9Nq1xK233Z 2026-08-03 8/400 2026-08-04 03:21 by k7OM8YghWbkC
[硕博家园] 售SCI一区T0P文章,我:8.O.55.1.O.54,科目齐全,可+急 +4 cu9Nq1xK233Z 2026-08-03 12/600 2026-08-04 03:17 by k7OM8YghWbkC
[基金申请] 什么时候能放榜呀? +3 Jacob678 2026-08-03 3/150 2026-08-03 16:14 by gltch
[高分子] UV压敏胶开发 +3 ichall 2026-07-30 5/250 2026-08-03 14:40 by Sunrisepay
[基金申请] 面上再次挂了,太难了,躺也躺不了,倦也卷不过,小学校之殇! +19 低垂的野花 2026-07-31 25/1250 2026-08-03 09:25 by gy116024
[基金申请] 2026年国自然面上资助率 +16 布布和一二 2026-07-30 22/1100 2026-08-03 09:20 by gy116024
[教师之家] 基础研究怎么拉横向,学校到款任务越来越多,难以完成 拉横向,都有哪些途径啊 +8 锦衣卫寒战 2026-07-28 12/600 2026-08-03 08:22 by syl200707
[基金申请] 微信指数没变化,科研之友没阅读 +15 wangze12014 2026-07-28 19/950 2026-08-02 20:05 by 蔡棒棒菂
[考博] 2027年申博 50+3 射雕英雄胜 2026-07-30 3/150 2026-08-02 09:36 by lfy8008
[高分子] HXDI做水性聚氨酯乳液,是不是特别容易出渣 15+3 yuyusuv 2026-07-29 3/150 2026-07-31 09:21 by huizingga
[基金申请] 系统今天又提示维护了,估计离放榜不远了 +11 winnerche 2026-07-29 15/750 2026-07-30 23:08 by jnhyjjm
信息提示
请填处理意见