Interior-Point Polynomial Algorithms in Convex Programming

http://www.amazon.com/Interior-Point-Polynomial-Algorithms-Programming-Mathematics/dp/0898715156/

这本书网上出现过电子版（大小16M左右），但现在所有链接都死了，不知哪位是否收藏过，不胜感激！
注：不是 interior point polynomial time methods in convex programming 2004 ，这是后来的一个 Lecture Notes

Interior-Point Polynomial Algorithms in Convex Programming (Studies in Applied and Numerical Mathematics) [Paperback]Yurii Nesterov (Author), Arkadii Nemirovskii (Author)


Product Details  

• Paperback: 405 pages
• Publisher: Society for Industrial  Mathematics (July 1995)
• Language: English
• ISBN-10: 0898715156
• ISBN-13: 978-0898715156
• Product Dimensions: 10 x 6.9 x 1 inches
• Shipping Weight: 1.8 pounds
• Average Customer Review: Be the first to review this item
• Amazon Bestsellers Rank: #2,951,543 in Books (See Top 100 in Books)

稳健投资组合优化 Robust Portfolio Optimization  需要用到, 用interior point algorithms 求解 SOCP socond order cone programming 效率很高，可以用于 Large scale (Robust)portfolio optimazation

这些链接都死了，都放在RS网盘上，相互转来转去
http://www.ebookee.net/Interior-Point-Polynomial-Algorithms-in-Convex-Programming_212201.html

http://www.pet2008.cn/viewthread.php?tid=108306

http://bbs.sciencenet.cn/showtopic-39547.aspx

http://www.addebook.com/tech/mathematics/interior-point-polynomial-algorithms-in-convex-programming-2_17296.html

同求，顶起来！

看看是不是这本书？

看看是不是这本书？ 是的话，要奖励！