| ²é¿´: 416 | »Ø¸´: 2 | |||
| µ±Ç°Ö»ÏÔʾÂú×ãÖ¸¶¨Ìõ¼þµÄ»ØÌû£¬µã»÷ÕâÀï²é¿´±¾»°ÌâµÄËùÓлØÌû | |||
cfx2002Ìú¸Ëľ³æ (ÕýʽдÊÖ)
|
[ÇóÖú]
Çë´ó¼Ò°ïÎÒ¿´¿´Õâ¸öÎÄÕ±»¼ìË÷ÁËÂð£¬EIÆÚ¿¯µÄ
|
||
|
Çë´ó¼Ò°ïÎÒ¿´¿´Õâ¸öÎÄÕ±»¼ìË÷ÁËÂð£¬EIÆÚ¿¯µÄ£¬Ð»Ð». ÌâÄ¿£ºA new predictor-corrector algorithm for SDP with polynomial convergence ×÷ÕߣºFeixiang Chen and YumingFeng ÔÓÖ¾£ºItalian Journal of Pure and Applied Mathematics ISSN 2239-0227 Issue n. 29-2012. pp:7-14 лл£¡£¡£¡ [ Last edited by cxksama on 2013-4-9 at 09:57 ] |
» ²ÂÄãϲ»¶
282Çóµ÷¼Á
ÒѾÓÐ22È˻ظ´
283Çóµ÷¼Á
ÒѾÓÐ5È˻ظ´
265Çóµ÷¼Á
ÒѾÓÐ21È˻ظ´
288Çóµ÷¼Á Ò»Ö¾Ô¸¹þ¹¤´ó ²ÄÁÏÓ뻯¹¤
ÒѾÓÐ10È˻ظ´
µ÷¼Á0855-288
ÒѾÓÐ5È˻ظ´
µç×ÓÐÅÏ¢µ÷¼Á½»²æÑ§¿ÆÓÐÍÆ¼öÂð
ÒѾÓÐ6È˻ظ´
266Çóµ÷¼Á
ÒѾÓÐ6È˻ظ´
²ÄÁÏ¿ÆÑ§Ó빤³Ì¿¼ÑÐ
ÒѾÓÐ10È˻ظ´
283·Ö²ÄÁÏÓ뻯¹¤Çóµ÷¼Á
ÒѾÓÐ29È˻ظ´
Ò»Ö¾Ô¸¹þ¶û±õ¹¤Òµ´óѧ085600Ó¢Ò»Êý¶þ337·ÖÇóµ÷¼Á
ÒѾÓÐ4È˻ظ´
» ±¾Ö÷ÌâÏà¹Ø¼ÛÖµÌùÍÆ¼ö£¬¶ÔÄúͬÑùÓаïÖú:
Çë´ó¼Ò°ïæ¿´¿´È¥ÄêÔø±»·ÅÈë¹Û²ìÁбíµÄÕâ¸öÆÚ¿¯»¹ÊôÓÚsciµÄÆÚ¿¯Âð£¬
ÒѾÓÐ15È˻ظ´
Ïë·¢EI¹úÍâÆÚ¿¯£¨µç×ÓÐÅÏ¢À࣬JA£©£¬µ«ÎÒ²»ÖªµÀÔõôÕÒ£¿Çë´ó¼Ò°ïæָµãÒ»ÏÂ
ÒѾÓÐ21È˻ظ´
дÁËÆªÉúÎï²âÁ¿·½ÃæµÄÎÄÕ£¬ÇóÖúͶµ½ÄĸöÍâÎÄEI¼ìË÷ÆÚ¿¯£¿
ÒѾÓÐ6È˻ظ´
Çë´ó¼Ò°ïÎÒ¿´¿´Õâ¸öÎÄÕ±»¼ìË÷ÁËÂð£¬Ð»Ð»
ÒѾÓÐ4È˻ظ´
¡¾2012-12-30¡¿EIÆÚ¿¯JCITÕ÷¸å,10Ôµ׳ö°æµÄÎÄÕ£¬ÏÖÒÑÍê³ÉEI ¼ìË÷£¨JA£©£¬
ÒѾÓÐ118È˻ظ´
´ó¼Ò°ïÎÒ¿´¿´ÕâÆªÎÄÕ¸ÃÈçºÎ´¦Àí£¬Ð»Ð»!
ÒѾÓÐ3È˻ظ´
Çë´ó¼Ò°ïÎÒ¿´¿´Õâ¸öÔÓÖ¾ÊDz»ÊÇSCIµÄ£¿
ÒѾÓÐ3È˻ظ´
Çó½âͶ¸å£¨Õñ¶¯Óë³å»÷£©µÄÓʼþ»Ø¸´£¬´ó¼Ò°ïÎÒ¿´Õâ¸öÊÇɶÒâ˼£¬Ð»Ð»¡£
ÒѾÓÐ8È˻ظ´
ÇóÖú£ºÇë°ïÎÒÍÆ¼öeiÊÕ¼µ«ÊÇ·ÇsciÊÕ¼µÄÆÚ¿¯
ÒѾÓÐ15È˻ظ´
nuaawq
ÖÁ×ðľ³æ (ÖªÃû×÷¼Ò)
- Ó¦Öú: 2144 (½²Ê¦)
- ½ð±Ò: 30832.1
- É¢½ð: 42
- ºì»¨: 17
- Ìû×Ó: 8079
- ÔÚÏß: 582.9Сʱ
- ³æºÅ: 1391607
- ×¢²á: 2011-09-05
- רҵ: ½ðÊô¹¦ÄܲÄÁÏ
¡¾´ð°¸¡¿Ó¦Öú»ØÌû
¸Ðл²ÎÓ룬ӦÖúÖ¸Êý +1
|
Accession number: 20130916051048 Title: A new predictor-corrector algorithm for SDP with polynomial convergence Authors: Chen, Feixiang1 ; Feng, Yuming1 Author affiliation: 1 School of Mathematics and Statistics, Chongqing Three Gorges University, Wanzhou, Chongqing, 404000, China Corresponding author: Chen, F. (cfx2002@126.com) Source title: Italian Journal of Pure and Applied Mathematics Abbreviated source title: Ital. J. Pure Appl. Math. Issue: 29 Issue date: December 2012 Publication year: 2012 Pages: 7-14 Language: English ISSN: 11268042 Document type: Journal article (JA) Publisher: Forum-Editrice Universitaria Udinese SRL, Via Palladio 8, Udine, 33100, Italy Abstract: We establish the polynomiality of primal-dual interior-point algorithms for SDP based on the direction of the M-Z family of search directions. We show that the polynomial iteration-complexity bounds of the well known algorithms for linear programming, namely, the predictor-corrector algorithm, carry over to the context of SDP. Number of references: 10 Main heading: Iterative methods Controlled terms: Algorithms - Mathematical programming - Polynomials Uncontrolled terms: Interior point algorithm - Path-following method - Polynomial complexity - Predictor-corrector algorithm - Primal-dual interior-point algorithm - Search direction - Semidefinite programming problem Classification code: 723 Computer Software, Data Handling and Applications - 921 Mathematics - 922 Statistical Methods Database: Compendex Compilation and indexing terms, © 2013 Elsevier Inc. |
3Â¥2013-04-09 09:51:22
cl_njust
½ð³æ (ÕýʽдÊÖ)
- Ó¦Öú: 12 (СѧÉú)
- ½ð±Ò: 1069.8
- É¢½ð: 281
- ºì»¨: 4
- Ìû×Ó: 350
- ÔÚÏß: 200.6Сʱ
- ³æºÅ: 1896901
- ×¢²á: 2012-07-17
- ÐÔ±ð: GG
- רҵ: ÐźÅÀíÂÛÓëÐźŴ¦Àí
2Â¥2013-04-09 09:38:38














»Ø¸´´ËÂ¥