Diagonally dominant programming in distance geometry

DOI10.1007/978-3-319-45587-7_20MaRDI QIDQ2835679zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• New methods for the distance geometry problem
• Distance geometry in linearizable norms
• Positive semidefinite relaxations for distance geometry problems.
• The isomap algorithm in distance geometry
• A cycle-based formulation for the distance geometry problem

Cites work

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

Cited in

(12)

• Distance geometry in linearizable norms
• Open research areas in distance geometry
• Maximum feasible subsystems of distance geometry constraints
• Barvinok's naive algorithm in distance geometry
• Distance geometry and data science
• DSOS and SDSOS optimization: more tractable alternatives to sum of squares and semidefinite optimization
• Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming
• The isomap algorithm in distance geometry
• A cycle-based formulation for the distance geometry problem
• Rejoinder on: ``Distance geometry and data science
• Cycle-based formulations in distance geometry
• scientific article; zbMATH DE number 1824226 (Why is no real title available?)

Describes a project that uses

Uses Software

• SPOTless
• PICOS
• CPLEX

This page was built for publication: Diagonally dominant programming in distance geometry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835679)