Interior-point polynomial algorithms in convex programming /

Saved in:
Bibliographic Details
Author / Creator:Nesterov, I︠U︡. E.
Imprint:Philadelphia, Pa. : Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104), ©1994.
Description:1 online resource (ix, 405 pages)
Language:English
Series:SIAM studies in applied mathematics ; vol. 13
SIAM studies in applied mathematics ; 13.
Subject:
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/12577365
Hidden Bibliographic Details
Other authors / contributors:Nemirovskiĭ, A. S. (Arkadiĭ Semenovich)
ISBN:9781611970791
1611970792
9780898713190
0898713196
0898715156
9780898715156
Notes:Includes bibliographical references (pages 387-402) and index.
Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2010.
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. http://purl.oclc.org/DLF/benchrepro0212
English.
digitized 2010 HathiTrust Digital Library committed to preserve
Summary:Specialists working in the areas of optimization, mathematical programming, or control theory will find this book invaluable for studying interior-point methods for linear and quadratic programming, polynomial-time methods for nonlinear convex programming, and efficient computational methods for control problems and variational inequalities. A background in linear algebra and mathematical programming is necessary to understand the book. The detailed proofs and lack of "numerical examples" might suggest that the book is of limited value to the reader interested in the practical aspects of convex optimization, but nothing could be further from the truth. An entire chapter is devoted to potential reduction methods precisely because of their great efficiency in practice.
Other form:Print version: 0898715156 9780898715156
Publisher's no.:AM13 SIAM