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
Applied Mathematical Programming Using Algebraic Systemsby Bruce A. McCarl, Thomas H. Spreen - Texas A&M University
This book is intended to both serve as a reference guide and a text for a course on Applied Mathematical Programming. The text concentrates upon conceptual issues, problem formulation, computerized problem solution, and results interpretation.
(13989 views)
The Design of Approximation Algorithmsby 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.
(18034 views)
Optimization and Dynamical Systemsby U. Helmke, J. B. Moore - Springer
Aimed at mathematics and engineering graduate students and researchers in the areas of optimization, dynamical systems, control systems, signal processing, and linear algebra. The problems solved are those of linear algebra and linear systems theory.
(15921 views)
Discrete Optimizationby Guido Schaefer - Utrecht University
From the table of contents: Preliminaries (Optimization Problems); Minimum Spanning Trees; Matroids; Shortest Paths; Maximum Flows; Minimum Cost Flows; Matchings; Integrality of Polyhedra; Complexity Theory; Approximation Algorithms.
(10413 views)