**Convex Optimization**

by Stephen Boyd, Lieven Vandenberghe

**Publisher**: Cambridge University Press 2004**ISBN/ASIN**: 0521833787**ISBN-13**: 9780521833783**Number of pages**: 730

**Description**:

Convex optimization problems arise frequently in many different fields. A comprehensive introduction to the subject, this book shows in detail how such problems can be solved numerically with great efficiency. The focus is on recognizing convex optimization problems and then finding the most appropriate technique for solving them. The text contains many worked examples and homework exercises and will appeal to students, researchers and practitioners in fields such as engineering, computer science, mathematics, statistics, finance, and economics.

Download or read it online for free here:

**Download link**

(5.5MB, PDF)

## Similar books

**Notes on Optimization**

by

**Pravin Varaiya**-

**Van Nostrand**

The author presents the main concepts mathematical programming and optimal control to students having diverse technical backgrounds. A reasonable knowledge of advanced calculus, linear algebra, and linear differential equations is required.

(

**7369**views)

**Iterative Methods for Optimization**

by

**C.T. Kelley**-

**Society for Industrial Mathematics**

This book presents a carefully selected group of methods for unconstrained and bound constrained optimization problems and analyzes them in depth both theoretically and algorithmically. It focuses on clarity in algorithmic description and analysis.

(

**5933**views)

**Linear Programming**

by

**Jim Burke**-

**University of Washington**

These are notes for an introductory course in linear programming. The four basic components of the course are modeling, solution methodology, duality theory, and sensitivity analysis. We focus on the simplex algorithm due to George Dantzig.

(

**2754**views)

**The Design of Approximation Algorithms**

by

**D. P. Williamson, D. B. Shmoys**-

**Cambridge University Press**

This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.

(

**9454**views)