Can I read Yurii Nesterov And Arkadii Nemirovskii Interior Point Polynomial Algorithms In Convex Programming on EtoBox?

Yurii Nesterov And Arkadii Nemirovskii Interior Point Polynomial Algorithms In Convex Programming by SIAM, Nesterov, Yurii, Nemirovskii, Arkadii, Yurii Nesterov, Arkadii Nemirovskii, I︠U︡. E Nesterov is a nonfiction available to read on EtoBox.

What is Yurii Nesterov And Arkadii Nemirovskii Interior Point Polynomial Algorithms In Convex Programming about?

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 methods for nonlinear convex programming, efficient computation methods for control problems and variational inequalities, and acceleration of path-following methods are covered. In this book, the authors describe the first unified theory of polynomial-time interior-point methods. Their approach provides a simple and elegant framework in which all known polynomial-time interior-point methods can be explained and analyzed; this approach yields polynomial-time interior-point methods for a wide variety of problems beyond the traditional linear and quadratic programs.

Who reads Yurii Nesterov And Arkadii Nemirovskii Interior Point Polynomial Algorithms In Convex Programming?

Author

SIAM, Nesterov, Yurii, Nemirovskii, Arkadii, Yurii Nesterov, Arkadii Nemirovskii, I︠U︡. E Nesterov

Publisher

Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104)

Published

1993

Language

EN

ISBN

9780898715156

Category

nonfiction

Subjects

Mathematics, Computer Science, Programming