Convex Optimization & Euclidean Distance Geometry

Convex Optimization & Euclidean Distance Geometry

Convex Optimization & Euclidean Distance Geometry is about convex optimization, convex geometry (with particular attention to distance geometry), and nonconvex, combinatorial, and geometrical problems that can be relaxed or transformed into convex optimization problems.

Existence of geometric interpretation for any convex optimization problem is a certainty. If a problem can be transformed to an equivalent convex optimization, then ability to visualize its geometry is acquired. There is a great race under way to determine which important problems can be posed in a convex setting. Yet, that skill acquired by understanding the geometry ...