Sorry,the image is not available

Nesterov Yurii, Nemirovskii Arkadii:
Interior Point Polynomial Algorithms In Convex Programming

Society For Industrial & Applied Mathematics,U.S. (United States), 2006
Paperback, 415 pages
Size: 255x177 mm
ISBN: 9780898715156
ISBN-10: 0898715156

Our price: £69.75
List price: £77.50
You save: 10%

Usually ships within 2 weeks.

Will be shipped from: United Kingdom
 Add to Shopping Basket 

Interior Point Polynomial Algorithms In Convex Programming

In this book, the authors describe the first unified theory of polynomial-time interior-point methods.

Related links:

Yurii Nesterov
Arkadii Nemirovskii
Optimization
Mathematics
Mathematics and science
Society For Industrial & Applied Mathematics,U.S.

More information from Wikipedia:

Yurii Nesterov
Arkadii Nemirovskii
© 2006-2009 Eruditor Ltd and its partners
McAfee Secure sites help keep you safe from identity theft, credit card fraud, spyware, spam, viruses and online scams

Search

Whole catalogue
Metaphysics & ontology

Advanced Search

Browse

Authors’ Name Index

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z