Interior-point Polynomial Algorithms in Convex Programming

Interior-point Polynomial Algorithms in Convex Programming
Author :
Publisher : SIAM
Total Pages : 414
Release :
ISBN-10 : 1611970792
ISBN-13 : 9781611970791
Rating : 4/5 (791 Downloads)

Book Synopsis Interior-point Polynomial Algorithms in Convex Programming by : Yurii Nesterov

Download or read book Interior-point Polynomial Algorithms in Convex Programming written by Yurii Nesterov and published by SIAM. This book was released on 1994-01-01 with total page 414 pages. Available in PDF, EPUB and Kindle. Book excerpt: Specialists working in the areas of optimization, mathematical programming, or control theory will find this book invaluable for studying interior-point methods for linear and quadratic programming, polynomial-time methods for nonlinear convex programming, and efficient computational methods for control problems and variational inequalities. A background in linear algebra and mathematical programming is necessary to understand the book. The detailed proofs and lack of "numerical examples" might suggest that the book is of limited value to the reader interested in the practical aspects of convex optimization, but nothing could be further from the truth. An entire chapter is devoted to potential reduction methods precisely because of their great efficiency in practice.


Interior-point Polynomial Algorithms in Convex Programming Related Books

Interior-point Polynomial Algorithms in Convex Programming
Language: en
Pages: 414
Authors: Yurii Nesterov
Categories: Mathematics
Type: BOOK - Published: 1994-01-01 - Publisher: SIAM

DOWNLOAD EBOOK

Specialists working in the areas of optimization, mathematical programming, or control theory will find this book invaluable for studying interior-point methods
Lectures on Modern Convex Optimization
Language: en
Pages: 500
Authors: Aharon Ben-Tal
Categories: Technology & Engineering
Type: BOOK - Published: 2001-01-01 - Publisher: SIAM

DOWNLOAD EBOOK

Here is a book devoted to well-structured and thus efficiently solvable convex optimization problems, with emphasis on conic quadratic and semidefinite programm
Algorithms for Convex Optimization
Language: en
Pages: 314
Authors: Nisheeth K. Vishnoi
Categories: Computers
Type: BOOK - Published: 2021-10-07 - Publisher: Cambridge University Press

DOWNLOAD EBOOK

In the last few years, Algorithms for Convex Optimization have revolutionized algorithm design, both for discrete and continuous optimization problems. For prob
A Mathematical View of Interior-point Methods in Convex Optimization
Language: en
Pages: 124
Authors: James Renegar
Categories: Mathematics
Type: BOOK - Published: 2001-01-01 - Publisher: SIAM

DOWNLOAD EBOOK

Here is a book devoted to well-structured and thus efficiently solvable convex optimization problems, with emphasis on conic quadratic and semidefinite programm
Primal-dual Interior-Point Methods
Language: en
Pages: 309
Authors: Stephen J. Wright
Categories: Interior-point methods
Type: BOOK - Published: 1997-01-01 - Publisher: SIAM

DOWNLOAD EBOOK

In the past decade, primal-dual algorithms have emerged as the most important and useful algorithms from the interior-point class. This book presents the major