This book is about convex optimization, a special class of mathematical optimization

problems, which includes least-squares and linear programming problems. It

is well known that least-squares and linear programming problems have a fairly

complete theory, arise in a variety of applications, and can be solved numerically

very efficiently. The basic point of this book is that the same can be said for the

larger class of convex optimization problems.