๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Interior-Point Polynomial Algorithms in Convex Programming

โœ Scribed by Iu. E. Nesterov, Arkadii Nemirovskii, Yurii Nesterov


Publisher
Soc for Industrial & Applied Math
Year
1994
Tongue
English
Leaves
416
Series
Siam Studies in Applied Mathematics 13
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Interior-point polynomial algorithms in
โœ Iu. E. Nesterov, Arkadii Nemirovskii, Yurii Nesterov ๐Ÿ“‚ Library ๐Ÿ“… 1994 ๐Ÿ› Society for Industrial and Applied Mathematics ๐ŸŒ English

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, interior point methods for linear and quadratic programming, polynomial time

Interior-Point Polynomial Algorithms in
โœ Iu. E. Nesterov, Arkadii Nemirovskii, Yurii Nesterov ๐Ÿ“‚ Library ๐Ÿ“… 1994 ๐Ÿ› Soc for Industrial & Applied Math ๐ŸŒ English

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, interior point methods for linear and quadratic programming, polynomial time