Interior-point polynomial algorithms in convex programming /
Saved in:
| Author / Creator: | Nesterov, I͡U. E. |
|---|---|
| Imprint: | Philadelphia : Society for Industrial and Applied Mathematics, c1994. |
| Description: | ix, 405 p. ; 27 cm. |
| Language: | English |
| Series: | SIAM studies in applied mathematics ; vol. 13 SIAM studies in applied mathematics 13. |
| Subject: | |
| Format: | Print Book |
| URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/1605127 |
| Summary: | Written for specialists working in optimization, mathematical programming, or control theory. The general theory of path-following and potential reduction interior point polynomial time methods, interior point methods for linear and quadratic programming, polynomial time methods for nonlinear convex programming, efficient computation methods for control problems and variational inequalities, and acceleration of path-following methods are covered. Annotation c. by Book News, Inc., Portland, Or. |
|---|---|
| Physical Description: | ix, 405 p. ; 27 cm. |
| Bibliography: | Includes bibliographical references (p. 387-402) and index. |
| ISBN: | 0898713196 |