|
![]() |
|||
|
||||
OverviewThis is an elementary exposition of the main ideas of complexity theory for convex optimization. The book covers optimal methods and lower complexity bounds for smooth and non-smooth convex optimization. A separate chapter is devoted to polynomial-time interior-point methods. Full Product DetailsAuthor: Y. NesterovPublisher: Springer-Verlag New York Inc. Imprint: Springer-Verlag New York Inc. Edition: 2004 ed. Volume: 87 Dimensions: Width: 15.50cm , Height: 1.50cm , Length: 23.50cm Weight: 1.200kg ISBN: 9781402075537ISBN 10: 1402075537 Pages: 236 Publication Date: 31 December 2003 Audience: College/higher education , Professional and scholarly , Postgraduate, Research & Scholarly , Professional & Vocational Format: Hardback Publisher's Status: Active Availability: Awaiting stock ![]() The supplier is currently out of stock of this item. It will be ordered for you and placed on backorder. Once it does come back in stock, we will ship it out for you. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |