Normal view MARC view ISBD view

Interior-point polynomial algorithms in convex programming/

Nesterov, IU. E.

Interior-point polynomial algorithms in convex programming/ Yurii Nesterov and Arkadii Nemirovskii. - Philadelphia: Society for Industrial and Applied Mathematics, c1994. - ix, 405 p.; 27 cm. - SIAM studies in applied mathematics; vol. 13. . - SIAM studies in applied mathematics; 13. .

Includes bibliographical references (p. 387-402) and index.

ISBN: 0898713196

LCCN: 93038912 //r94

Subjects--Topical Terms:
Programming (Mathematics)
Convex programming.

Dewey Class. No.: 519.76 / N468i

Place hold
Print
Add to your cart (remove)
Suggest for purchase
Send to device
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS ISBD
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)