Normal view MARC view ISBD view

Convex optimization algorithms.

By: Bertsekas, Dimitri P.
Publisher: Belmont, Massacnjsetts Athena Scientific 2015Description: xii, 564 p. ill. 25 cm.ISBN: 9781886529281.Subject(s): Mathematical optimization | Convex functionsDDC classification: 519.6 Summary: This book, developed through class instruction at MIT over the last 15 years, provides an accessible, concise, and intuitive presentation of algorithms for solving convex optimization problems. It relies on rigorous mathematical analysis, but also aims at an intuitive exposition that makes use of visualization where possible. This is facilitated by the extensive use of analytical and algorithmic concepts of duality, which by nature lend themselves to geometrical interpretation. The book places particular emphasis on modern developments, and their widespread applications in fields such as large-scale resource allocation problems, signal processing, and machine learning.
Tags from this library: No tags from this library for this title. Log in to add tags.
Item type Current location Call number Status Date due Barcode
Books 519.6 BER (Browse shelf) Checked out 15/05/2025 032279

Includes bibliographical references and index.

This book, developed through class instruction at MIT over the last 15 years, provides an accessible, concise, and intuitive presentation of algorithms for solving convex optimization problems. It relies on rigorous mathematical analysis, but also aims at an intuitive exposition that makes use of visualization where possible. This is facilitated by the extensive use of analytical and algorithmic concepts of duality, which by nature lend themselves to geometrical interpretation. The book places particular emphasis on modern developments, and their widespread applications in fields such as large-scale resource allocation problems, signal processing, and machine learning.

There are no comments for this item.

Log in to your account to post a comment.

Powered by Koha