We study the performance of the dgsol code for the solution of distance geometry problems with lower and upper bounds on distance constraints. The dgsol code uses only a sparse set of distance constraints, while other algorithms tend to work with a dense set of constraints either by imposing additional bounds or by deducing bounds from the given bounds. Our computational results show that prote...

We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for polynomial optimization simplifies and has finite convergence, a highly desirable feature as convex problems are in principle easier to solve. In addition, if a ba...

expressionism “Ocean Park No. 27” and “Ocean Park No. 129” by Richard Diebenkorn (1922-1993), inspired by aerial landscapes Francesco Bullo (UCSB) Robotic Coordination SIAM CT 2011 6 / 42 Territory partitioning ... centralized district design California Voting Districts: 2008 Obama/McCain votes Francesco Bullo (UCSB) Robotic Coordination SIAM CT 2011 7 / 42 Territory partitioning is ... animal ...