Convex Optimization & Euclidean Distance Geometry

Jon Dattorro

ISBN 10: 0615193684 / ISBN 13: 9780615193687

Published by Meboo Publishing, 2008

About this Item

nach der Bestellung gedruckt Neuware - Printed after ordering - 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.

Seller Inventory # 9780615193687

Bibliographic Details

• Title: Convex Optimization & Euclidean Distance Geometry
• Publisher: Meboo Publishing
• Publication Date: 2008
• Language: English
• ISBN 10: 0615193684
• ISBN 13: 9780615193687
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 280W x 216H x 39D millimeters 280 millimeters width by 216 millimeters height by 39 millimeters depth
• Weight: 1812 grams

About this title

Synopsis

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