Diagonally Dominant Programming in Distance Geometry

DOI10.1007/978-3-319-45587-7_20zbMath1451.51007OpenAlexW2518562508MaRDI QIDQ2835679

Leo Liberti, Gustavo Fruet Dias

Publication date: 30 November 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-45587-7_20

zbMATH Keywords

semidefinite programmingdistance geometrydiagonally-dominant inner approximationlocal nonlinear programmingrandomized-type rank reduction method

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonlinear programming (90C30) Combinatorial optimization (90C27) General theory of distance geometry (51K05)

Related Items

Maximum feasible subsystems of distance geometry constraints, Distance geometry and data science, Rejoinder on: ``Distance geometry and data science, Cycle-based formulations in distance geometry, DSOS and SDSOS Optimization: More Tractable Alternatives to Sum of Squares and Semidefinite Optimization

Uses Software

• CPLEX
• PICOS
• SPOTless

Cites Work

• Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
• The discretizable molecular distance geometry problem
• Theory of semidefinite programming for sensor network localization
• Solving Euclidean distance matrix completion problems via semidefinite progrmming
• Problems of distance geometry and convex properties of quadratic maps
• Measure concentration in optimization
• The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins
• Eigenvector synchronization, graph rigidity and the molecule problem
• Sum of squares basis pursuit with linear and second order cone programming
• Molecular distance geometry methods: from continuous to discrete
• A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• The Molecule Problem: Exploiting Structure in Global Optimization
• Euclidean Distance Geometry and Applications
• Computational Experience with the Molecular Distance Geometry Problem
• Positive semidefinite relaxations for distance geometry problems.