A Euclidean distance matrix model for protein molecular conformation
From MaRDI portal
Publication:2307747
DOI10.1007/s10898-019-00771-4zbMath1436.90112OpenAlexW2935924221MaRDI QIDQ2307747
Publication date: 25 March 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-019-00771-4
Euclidean distance matrixmajorized penalty approachaccelerated block coordinate descent methodprotein molecular conformation
Related Items (2)
An Ordinal Weighted EDM Model for Nonmetric Multidimensional Scaling ⋮ Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
- Clifford algebra and the discretizable molecular distance geometry problem
- An inexact primal-dual path following algorithm for convex quadratic SDP
- A stochastic/perturbation global optimization algorithm for distance geometry problems
- Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems
- Distance geometry optimization for protein structures
- A projected semismooth Newton method for problems of calibrating least squares covariance matrix
- Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction
- Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- An Efficient Inexact ABCD Method for Least Squares Semidefinite Programming
- Using a Distributed SDP Approach to Solve Simulated Protein Molecular Conformation Problems
- An SDP-Based Divide-and-Conquer Algorithm for Large-Scale Noisy Anchor-Free Graph Realization
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
- A Lagrangian Dual Approach to the Single-Source Localization Problem
- Ordinal Distance Metric Learning with MDS for Image Ranking
- A Semismooth Newton Method for the Nearest Euclidean Distance Matrix Problem
- Euclidean Distance Geometry and Applications
This page was built for publication: A Euclidean distance matrix model for protein molecular conformation
