Znn3bq.jpeg
²é¿´: 1335  |  »Ø¸´: 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µÄ»ØÌû

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)  
ÒýÓõIJο¼ÎÄÏ×: 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µÄ»ØÌû
²é¿´È«²¿ 4 ¸ö»Ø´ð

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   °kÐÐ: AUG 2011
±»ÒýÓÃÊý: 0 (Web of Science ¤«¤é)


[ ³­åh¤ò·Ç±íʾ] 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µÄ»ØÌû
×î¾ßÈËÆøÈÈÌûÍÆ¼ö [²é¿´È«²¿] ×÷Õß »Ø/¿´ ×îºó·¢±í
[¿¼ÑÐ] ÉúÎïѧ308Çóµ÷¼Á£¨Ò»Ö¾Ô¸»ª¶«Ê¦´ó£© +6 ÏàÐűػá¹ââÍòÕ 2026-04-10 6/300 2026-04-11 05:23 by zhuwenxu
[¿¼ÑÐ] ±¾ÈËÅ®º¢ +5 ºðºð£¬ 2026-04-10 6/300 2026-04-11 00:09 by ÈÎÎÄÁÁ
[¿¼ÑÐ] Ò»Ö¾Ô¸211£¬»¯Ñ§310·Ö£¬±¾¿ÆÖصãË«·Ç£¬Çóµ÷¼Á +23 ŬÁ¦·Ü¶·112 2026-04-08 23/1150 2026-04-10 23:29 by 314126402
[¿¼ÑÐ] 311Çóµ÷¼Á +11 xypÏë¶ÁÊé 2026-04-10 12/600 2026-04-10 15:15 by solbeg
[¿¼ÑÐ] 293µ÷¼Á +25 yj1221 2026-04-08 26/1300 2026-04-10 15:02 by ²ñС°×
[¿¼ÑÐ] »¯¹¤µ÷¼ÁÇóµ¼Ê¦ÊÕÁô£¡Ò»Ö¾Ô¸Ê§Àû£¬Ì¤Êµ¿Ï¸É£¬ÓÐÖ²ÎïÌáÈ¡¿ÆÑо­Àú +17 yzyzx 2026-04-09 17/850 2026-04-10 10:29 by wp06
[¿¼ÑÐ] ½­ËÕ´óѧ ¹¤¿Æµ÷¼Á ¼ñ© +3 Evan_Liu 2026-04-09 5/250 2026-04-10 10:22 by Evan_Liu
[¿¼ÑÐ] Çóµ÷¼Á +3 µçÆø300Çóµ÷¼Á²» 2026-04-08 3/150 2026-04-10 10:19 by LHGeng
[¿¼ÑÐ] 070300»¯Ñ§ Çóµ÷¼Á +13 73372112 2026-04-08 13/650 2026-04-09 20:22 by maddjdld
[¿¼ÑÐ] 0703»¯Ñ§Çóµ÷¼Á +21 ²»ÖªÃûµÄСئ 2026-04-08 21/1050 2026-04-09 18:55 by l_paradox
[¿¼ÑÐ] Çóµ÷¼ÁÏ£Íû»¹ÊÇÏ£ÍûÔÚɽºÓËÄÊ¡¸½½ü +3 ¿ìÀÖµÄС°×¸ë 2026-04-05 3/150 2026-04-09 17:36 by wp06
[¿¼ÑÐ] 086004 Çóµ÷¼Á 309 +7 Yin DY 2026-04-08 7/350 2026-04-09 13:59 by Delta2012
[¿¼ÑÐ] Ò»Ö¾Ô¸»ª¶«Àí¹¤085601²ÄÁϹ¤³Ì303·ÖÇóµ÷¼Á +15 a1708 2026-04-06 15/750 2026-04-08 16:23 by luoyongfeng
[¿¼ÑÐ] 388Çóµ÷¼Á +6 ËÄ´¨ÍõÌÎ 2026-04-07 8/400 2026-04-08 00:17 by JourneyLucky
[¿¼ÑÐ] 22408 һ־Ը˫һÁ÷È˹¤ÖÇÄÜ300·Ö ËÄÁù¼¶£¬Êý¾Ý·ÖÎö¹ú½± +4 zzfeng123 2026-04-06 6/300 2026-04-07 21:02 by zzfeng123
[¿¼ÑÐ] ÇóÖú +3 ¿¨¿¨¶«88 2026-04-06 4/200 2026-04-06 15:28 by going home
[¿¼ÑÐ] 085405Èí¼þ¹¤³Ì301·ÖÇóµ÷¼Á£¬×¨Ë¶¿É¿çרҵ£¬ËÄÁù¼¶Òѹý +3 ¾²¾²ÏëÏë 2026-04-05 3/150 2026-04-06 15:23 by nepu_uu
[¿¼ÑÐ] 0855Çóµ÷¼Á²ÄÁÏ +11 ºìÌÒׯׯ 2026-04-04 12/600 2026-04-06 10:26 by À¶ÔÆË¼Óê
[¿¼ÑÐ] ²ÄÁÏר˶322·Ö +10 ¹þ¹þ¹þºðºðºð¹þ 2026-04-04 10/500 2026-04-05 21:22 by ѧԱ8dgXkO
[¿¼ÑÐ] µ÷¼Á +3 Àî¹ã»ð 2026-04-05 3/150 2026-04-05 18:57 by À¶ÔÆË¼Óê
ÐÅÏ¢Ìáʾ
ÇëÌî´¦ÀíÒâ¼û