24小时热门版块排行榜    

查看: 1484  |  回复: 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 的主题更新
最具人气热帖推荐 [查看全部] 作者 回/看 最后发表
[基金申请] 放榜前的不淡定 20+4 snowwithsea 2026-08-19 17/850 2026-08-24 10:20 by echo8914667
[基金申请] 明天应该可查了!? +4 chengyan1220 2026-08-23 4/200 2026-08-24 08:47 by gloomy6159
[基金申请] 范进中举一文的中心思想 +5 炎黄贵胄 2026-08-22 6/300 2026-08-24 06:34 by sincosx
[基金申请] 建议基金发布提前给出明确的时间点 +11 kulium 2026-08-21 14/700 2026-08-24 02:12 by 流流伤
[基金申请] 2026国自然函评费到账 +16 羊腰板 2026-08-21 17/850 2026-08-23 23:02 by tianxiaochun
[基金申请] 2026年的国家社科基金项目通讯评审的新规则与新动向、新挑战 +4 process2012 2026-08-23 5/250 2026-08-23 19:58 by jurkat.1640
[教师之家] 跳槽后在研项目怎么办? +5 简单化xn 2026-08-22 10/500 2026-08-23 12:38 by 简单化xn
[基金申请] 今天放榜吗? +15 布布和一二 2026-08-19 16/800 2026-08-23 09:55 by 张春生
[基金申请] 93BebMhtakh前后11位开头都是大写 +7 且听虎啸 2026-08-17 8/400 2026-08-22 21:55 by 医学老男孩
[基金申请] 只有每年这种时候来逛逛小木虫 +24 yaoyewhu2008 2026-08-20 26/1300 2026-08-22 17:43 by kammury
[基金申请] filecode,4个jtjc了 +13 ziyangfang 2026-08-19 16/800 2026-08-22 17:08 by WH3796
[基金申请] 人气不行了 +8 fansofjerry 2026-08-21 8/400 2026-08-22 16:30 by zyqchem
[基金申请] 时间戳今天,20号变了 +5 archvillain 2026-08-20 5/250 2026-08-22 06:12 by hui_daxiao
[基金申请] 看来今天不会放榜了? +8 chengyan1220 2026-08-21 11/550 2026-08-21 17:52 by dcqxinyang
[基金申请] 时间戳又变了 +13 wuchongjun 2026-08-20 19/950 2026-08-21 17:21 by 紫杉醇
[基金申请] 我面上完蛋了 +7 且听虎啸 2026-08-20 8/400 2026-08-21 12:31 by 酷酷墨镜
[基金申请] 应该是下周三26日公布了吧? +4 哈哈蛤? 2026-08-21 4/200 2026-08-21 10:58 by Vivilian
[论文投稿] 投稿咨询 +5 wwm09 2026-08-17 7/350 2026-08-21 10:11 by 期刊论文帮手
[基金申请] 估计是周四 +3 archvillain 2026-08-18 3/150 2026-08-21 01:48 by jnhyjjm
[基金申请] 今天维护系统维护 祝所有人 高中 +8 gjjjzhong 2026-08-18 9/450 2026-08-18 13:01 by 家与远方
信息提示
请填处理意见