| ²é¿´: 638 | »Ø¸´: 6 | |||
| ¡¾½±Àø¡¿ ±¾Ìû±»ÆÀ¼Û6´Î£¬×÷ÕßdnpÔö¼Ó½ð±Ò 4.5 ¸ö | |||
| µ±Ç°Ö÷ÌâÒѾ´æµµ¡£ | |||
dnpÈÙÓþ°æÖ÷ (ÖªÃû×÷¼Ò)
|
[×ÊÔ´]
¡¾×ªÌû¡¿convex optimization¡¾ÒÑËÑÎÞÖØ¸´¡¿
|
||
![]() £¬´ó¼ÒÐÂÄêºÃ£¡ºÜÈÙÐÒÓÉÎÒÀ´¹²ÏíÐÂÄêµÚÒ»±¾Ê飺convex optimization¡£ÔÚÎÒÃÇÈÕ³£Êý¾Ý´¦ÀíÖУ¬Æäʵ¾ø´ó²¿·ÖµÄÎÊÌâ¶¼ÊÇ͹ÓÅ»¯ÎÊÌ⣬Òò´Ë£¬ÓÐÒ»±¾½éÉܱȽÏÏêϸµÄÊé¾ÍÏÔµÃÃÖ×ãÕä¹óÁË¡£±¾ÊéÐÅÏ¢ÈçÏ£º Author:Stephen Boyd & Lieven Vandenberghe Address: Department of Electrical Engineering Stanford University; Electrical Engineering Department University of California, Los Angeles. Publisher: cambridge university press Publish data: First published 2004 Reprinted with corrections 2004 Reprinted with corrections 2006 Content: 1 Introduction I Theory: 2 Convex sets 3 Convex functions 4 Convex optimization problems 5 Duality II Applications 6 Approximation and fitting 7 Statistical estimation 8 Geometric problems III Algorithms 9 Unconstrained minimization 10 Equality constrained minimization 11 Interior-point methods Appendices A. Mathematical background B. Problems involving two quadratic functions C. Numerical linear algebra background References Notation Index ÏÂÔØµØÖ·£º http://media.imhb.cn/myspace/dow ... 055&huid=483979 username: xmc_dnp password: xmc_dnp123 ×îºó×£ËùÓеijæ×ÓÃÇÔÚ2008ÄêÀï¸üÉÏÒ»²ãÂ¥£¬ÍòÊÂÈçÒ⣻ԸСľ³æÔÚ2008ÄêÀïÔ½°ìÔ½ºÃ£¬ÌṩԽÀ´Ô½¶àµÄ¾µä×ÊÔ´£¡ [ Last edited by »ÃÓ°ÎÞºÛ on 2008-1-8 at 10:24 ] |
» ²ÂÄãϲ»¶
0860004 Çóµ÷¼Á 309·Ö
ÒѾÓÐ4È˻ظ´
²ÄÁÏÀà284µ÷¼Á
ÒѾÓÐ25È˻ظ´
Ò»Ö¾Ô¸211 0703»¯Ñ§ 346·ÖÇóµ÷¼Á
ÒѾÓÐ5È˻ظ´
¿¼Ñе÷¼Á-²ÄÁÏÀà-284
ÒѾÓÐ17È˻ظ´
280Çóµ÷¼Á
ÒѾÓÐ3È˻ظ´
0703»¯Ñ§Çóµ÷¼Á
ÒѾÓÐ18È˻ظ´
µ÷¼Á
ÒѾÓÐ15È˻ظ´
¸´ÊÔµ÷¼Á£¬Ò»Ö¾Ô¸Ö£ÖÝ´óѧ²ÄÁÏÓ뻯¹¤289·Ö
ÒѾÓÐ16È˻ظ´
349ѧ¿Æ»¯Ñ§045106Çóµ÷¼Á£¬»¯Ñ§Àà¶¼¿ÉÒÔ
ÒѾÓÐ7È˻ظ´
086003µ÷¼ÁÇóÖú
ÒѾÓÐ6È˻ظ´
3Â¥2008-01-04 03:10:03
4Â¥2008-01-04 10:38:35
5Â¥2008-01-07 19:04:52
6Â¥2008-01-08 09:12:30
7Â¥2008-02-09 22:35:50
¼òµ¥»Ø¸´
yzduan082Â¥
2008-01-04 00:23
»Ø¸´




















»Ø¸´´ËÂ¥