**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

**Universal Optimization and Its Application**

by

**Alexander Bolonkin**-

**viXra.org**

This book describes new method of optimization (''Method of Deformation of Functional'') that has the advantages at greater generality and flexibility as well as the ability to solve complex problems which other methods cannot solve.

(

**6106**views)

**An Introduction to Nonlinear Optimization Theory**

by

**Marius Durea, Radu Strugariu**-

**De Gruyter Open**

Starting with the case of differentiable data and the classical results on constrained optimization problems, continuing with the topic of nonsmooth objects involved in optimization, the book concentrates on both theoretical and practical aspects.

(

**7885**views)

**Lectures on Optimization: Theory and Algorithms**

by

**John Cea**-

**Tata Institute of Fundamental Research**

Contents: Differential Calculus in Normed Linear Spaces; Minimization of Functionals; Minimization Without Constraints; Minimization with Constraints; Duality and Its Applications; Elements of the Theory of Control and Elements of Optimal Design.

(

**11145**views)

**Convex Optimization: Algorithms and Complexity**

by

**Sebastien Bubeck**-

**arXiv.org**

This text presents the main complexity theorems in convex optimization and their algorithms. Starting from the fundamental theory of black-box optimization, the material progresses towards recent advances in structural and stochastic optimization.

(

**6676**views)