Normal view MARC view ISBD view

Interior-point polynomial algorithms in convex programming

Yurii Nesterov

Interior-point polynomial algorithms in convex programming - Socy.For Indl.& Appld.Maths.SIAM 2001 - 405

MD/1/0025/2009-10/02-05-09

Subjects--Topical Terms:
Interior-point methods.
Convex programming.

Place hold
Print
Suggest for purchase
Send to device
More searches

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