menu
{ "item_title" : "Convex Optimization & Euclidean Distance Geometry", "item_author" : [" Jon Dattorro "], "item_description" : "Convex Analysis is the calculus of inequalities while Convex Optimization is its application. Analysis is inherently the domain of the mathematician while Optimization belongs to the engineer. In layman's terms, the mathematical science of Optimization is the study of how to make a good choice when confronted with conflicting requirements. The qualifier Convex means: when an optimal solution is found, then it is guaranteed to be a best solution; there is no better choice. As any Convex Optimization problem has geometric interpretation, this book is about convex geometry (with particular attention to distance geometry), and nonconvex, combinatorial, and geometrical problems that can be relaxed or transformed into convex problems. A virtual flood of new applications follows by epiphany that many problems, presumed nonconvex, can be so transformed. Revised & Enlarged International Paperback Edition III", "item_img_path" : "https://covers4.booksamillion.com/covers/bam/0/61/519/368/0615193684_b.jpg", "price_data" : { "retail_price" : "99.99", "online_price" : "99.99", "our_price" : "99.99", "club_price" : "99.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Convex Optimization & Euclidean Distance Geometry|Jon Dattorro

Convex Optimization & Euclidean Distance Geometry

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

Convex Analysis is the calculus of inequalities while Convex Optimization is its application. Analysis is inherently the domain of the mathematician while Optimization belongs to the engineer. In layman's terms, the mathematical science of Optimization is the study of how to make a good choice when confronted with conflicting requirements. The qualifier Convex means: when an optimal solution is found, then it is guaranteed to be a best solution; there is no better choice. As any Convex Optimization problem has geometric interpretation, this book is about convex geometry (with particular attention to distance geometry), and nonconvex, combinatorial, and geometrical problems that can be relaxed or transformed into convex problems. A virtual flood of new applications follows by epiphany that many problems, presumed nonconvex, can be so transformed. Revised & Enlarged International Paperback Edition III

This item is Non-Returnable

Details

  • ISBN-13: 9780615193687
  • ISBN-10: 0615193684
  • Publisher: Meboo Publishing
  • Publish Date: February 2008
  • Dimensions: 11 x 8.5 x 1.47 inches
  • Shipping Weight: 3.68 pounds
  • Page Count: 734

Related Categories

You May Also Like...

    1

BAM Customer Reviews