Amazon cover image
Image from Amazon.com

Convex optimization algorithms

By: Material type: TextTextPublication details: Massachusetts Athena Scientific 2015Description: xii, 564pISBN:
  • 9781886529281 (hb.)
Subject(s): DDC classification:
  • 519.6 BER
Summary: This book aims at an up-to-date and accessible development of algorithms for solving convex optimization problems. The book covers almost all the major classes of convex optimization algorithms. Principal among these are gradient, subgradient, polyhedral approximation, proximal, and interior point methods. Most of these methods rely on convexity (but not necessarily differentiability) in the cost and constraint functions, and are often connected in various ways to duality. The book contains numerous examples describing in detail applications to specially structured problems.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode
Book Book Plaksha University Library Mathematics 519.6 BER (Browse shelf(Opens below)) Available 002994

http://www.athenasc.com/convexalgorithms.html

This book aims at an up-to-date and accessible development of algorithms for solving convex optimization problems. The book covers almost all the major classes of convex optimization algorithms. Principal among these are gradient, subgradient, polyhedral approximation, proximal, and interior point methods. Most of these methods rely on convexity (but not necessarily differentiability) in the cost and constraint functions, and are often connected in various ways to duality. The book contains numerous examples describing in detail applications to specially structured problems.

There are no comments on this title.

to post a comment.

Customize & Implimented by Jivesna Tech.

Total Visits to Site Till Date:best free website hit counter

Powered by Koha