Table of contents
About this book
In 1984, N. Karmarkar published a seminal paper on algorithmic linear programming. During the subsequent decade, it stimulated a huge outpouring of new algorithmic results by researchers world-wide in many areas of mathematical programming and numerical computation. This book gives an overview of the resulting, dramatic reorganization that has occurred in one of these areas: algorithmic differentiable optimization and equation-solving, or, more simply, algorithmic differentiable programming. The book is aimed at readers familiar with advanced calculus, numerical analysis, in particular numerical linear algebra, the theory and algorithms of linear and nonlinear programming, and the fundamentals of computer science, in particular, computer programming and the basic models of computation and complexity theory.
"Very fine monograph...filled with great insights."
-Joseph F. Traub, Columbia University
- DOI https://doi.org/10.1007/b97521
- Copyright Information John Lawrence Nazareth 2003
- Publisher Name Springer, New York, NY
- eBook Packages Springer Book Archive
- Print ISBN 978-0-387-95572-8
- Online ISBN 978-0-387-21788-8
- Series Print ISSN 1613-5237
- Buy this book on publisher's site