~ tracking down this book ~
Interior-Point Polynomial Algorithms in Convex Programming (Studies in Applied and Numerical Mathematics) by Yurii Nesterov — OmList
om
list
Swipe
Tournament
Lists
Friends
All
Movies
TV
Books
Games
Music
Podcasts
People
▾
Sign in
‹
only cover on file
›
I
nterior-Point Polynomial Algorithms in Convex Programming (Studies in Applied and Numerical Mathematics)
by
Yurii Nesterov
and
Arkadii Nemirovskii
1995
405 pages
~7½h read
‹
only cover on file
›
I
nterior-Point Polynomial Algorithms in Convex Programming (Studies in Applied and Numerical Mathematics)
by
Yurii Nesterov
and
Arkadii Nemirovskii
1995
405 pages
~7½h read
On your list
—
sign in to rank
Across the community
—
not yet ranked
How was it?
read it first
Disliked it
Liked it
Loved it
Have you read it?
tbr = to be read
Read
TBR
Didn’t start
Didn’t finish
§ Your notes
what you think →
Sign in
to keep a note.
§ Details
the particulars
Author
Yurii Nesterov, Arkadii Nemirovskii
Published
1995
Pages
405
Language
ENG
ISBN
9780898715156
§ Where to read
1 ways
O
Open Library
info
Details
❦
First published 1995
405 pages · in English
№ 405728
9780898715156
~ the end ~