Logo

Convex Optimization by Stephen Boyd, Lieven Vandenberghe

Large book cover: Convex Optimization

Convex Optimization
by

Publisher: Cambridge University Press
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.

Home page url

Download or read it online for free here:
Download link
(5.5MB, PDF)

Similar books

Book cover: Optimization and Dynamical SystemsOptimization and Dynamical Systems
by - 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.
(8971 views)
Book cover: Data Assimilation: A Mathematical IntroductionData Assimilation: A Mathematical Introduction
by - arXiv.org
This book provides a systematic treatment of the mathematical underpinnings of work in data assimilation. Authors develop a framework in which a Bayesian formulation of the problem provides the bedrock for the derivation and analysis of algorithms.
(1017 views)
Book cover: Optimization Algorithms on Matrix ManifoldsOptimization Algorithms on Matrix Manifolds
by - Princeton University Press
Many science and engineering problems can be rephrased as optimization problems on matrix search spaces endowed with a manifold structure. This book shows how to exploit the structure of such problems to develop efficient numerical algorithms.
(11783 views)
Book cover: Linear ProgrammingLinear Programming
by - 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.
(2820 views)