## Find a copy in the library

Finding libraries that hold this item...

## Details

Document Type: | Book |
---|---|

All Authors / Contributors: |
Dimitri P Bertsekas; Angelia Nedić; Asuman E Ozdaglar |

ISBN: | 1886529450 9781886529458 |

OCLC Number: | 52164213 |

Description: | xv, 534 pages : illustrations ; 24 cm. |

Contents: | 1. Basic convexity concepts -- 2. Convexity and optimization -- 3. Polyhedral convexity -- 4. Subgradients and constrained optimization -- 5. Lagrange multipliers -- 6. Lagrangian duality -- 7. Conjugate duality -- 8. Dual computational methods. |

Series Title: | Athena Scientific optimization and computation series. |

Responsibility: | Dimitri P. Bertsekas with Angelia Nedić and Asuman E. Ozdaglar. |

### Abstract:

This book focuses on the theory of convex sets and functions, and its connections with a number of topics that span a broad range from continuous to discrete optimization. These topics include Lagrange multiplier theory, Lagrangian and conjugate/Fenchel duality, minimax theory, and nondifferentiable optimization. The book evolved from a set of lecture notes for a graduate course at M.I.T. It is widely recognized that, aside from being an eminently useful subject in engineering, operations research, and economics, convexity is an excellent vehicle for assimilating some of the basic concepts of real analysis within an intuitive geometrical setting. Unfortunately, the subject's coverage in academic curricula is scant and incidental. We believe that at least part of the reason is the shortage of textbooks that are suitable for classroom instruction, particularly for nonmathematics majors. We have therefore tried to make convex analysis accessible to a broader audience by emphasizing its geometrical character, while maintaining mathematical rigor. We have included as many insightful illustrations as possible, and we have used geometric visualization as a principal tool for maintaining the students' interest in mathematical proofs. Our treatment of convexity theory is quite comprehensive, with all major aspects of the subject receiving substantial treatment. The mathematical prerequisites are a course in linear algebra and a course in real analysis in finite dimensional spaces (which is the exclusive setting of the book). A summary of this material, without proofs, is provided in Section 1.1. The coverage of the theory has been significantly extended in the exercises, which represent a major component of the book. Detailed solutions of all the exercises (nearly 200 pages) are internet-posted in the book's www page. --

## Reviews

*User-contributed reviews*

Add a review and share your thoughts with other readers.
Be the first.

Add a review and share your thoughts with other readers.
Be the first.

## Tags

Add tags for "Convex analysis and optimization".
Be the first.

## Similar Items

### Related Subjects:(12)

- Nonlinear programming.
- Convex functions.
- Mathematical optimization.
- Convexe functies.
- Convexe verzamelingen.
- Analyse (wiskunde)
- Optimaliseren.
- Programação convexa.
- Programação matemática.
- Tillämpad matematik.
- optimalizálás
- nemlineáris programozás

### User lists with this item (1)

- 6.079-PARRILO(3 items)
by MITLibraries updated 2009-07-20