This book describes the theory and analysis of interior-point algorithms, and explosive research development during the last ten years. It derives complexity results for linear and convex programming. Written in a style to motivate the reader, it provides state-of-the-art results which invoke computational techniques such as Matlab commands or generic algorithms. Contains future research topics for fractional programming and nonconvex (combinatorial) optimization.