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
Presents the major primal-dual algorithms for linear programming. A thorough, straightforward description of the theoretical properties of these methods.
The era of interior point methods (IPMs) was initiated by N. Karmarkar’s 1984 paper, which triggered turbulent research and reshaped almost all areas of optim
The starting point of this volume was a conference entitled "Progress in Mathematical Programming," held at the Asilomar Conference Center in Pacific Grove, Cal
Here is a book devoted to well-structured and thus efficiently solvable convex optimization problems, with emphasis on conic quadratic and semidefinite programm