Least-squares approximations in geometric buildup for solving distance geometry problems
From MaRDI portal
Publication:637550
DOI10.1007/S10957-011-9806-6zbMATH Open1229.90276OpenAlexW1965397948MaRDI QIDQ637550FDOQ637550
Recommendations
- A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- Extending the geometric build-up algorithm for the molecular distance geometry problem
- Distance geometry methods for protein structure determination
- A least-squares approach for discretizable distance geometry problems with inexact distances
- Rigid versus unique determination of protein structures with geometric buildup
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- Publication:4863354
- Distance geometry optimization for protein structures
- scientific article; zbMATH DE number 1488003
Cites Work
- scientific article; zbMATH DE number 3528420 (Why is no real title available?)
- scientific article; zbMATH DE number 841190 (Why is no real title available?)
- scientific article; zbMATH DE number 2188749 (Why is no real title available?)
- A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
- A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
- A multivariate partition approach to optimization problems
- A stochastic/perturbation global optimization algorithm for distance geometry problems
- An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- Calculating the Singular Values and Pseudo-Inverse of a Matrix
- Conditions for Unique Graph Realizations
- Distance geometry optimization for protein structures
- Equivalent formulations and necessary optimality conditions for the Lennard-Jones problem
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- Numerical Optimization
- On the Early History of the Singular Value Decomposition
- Solving molecular distance geometry problems by global optimization algorithms
- Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems
- The Molecule Problem: Exploiting Structure in Global Optimization
- The Solution of the Metric STRESS and SSTRESS Problems in Multidimensional Scaling Using Newtons Method
- The variation of the spectrum of a normal matrix
- Theory of semidefinite programming for sensor network localization
Cited In (3)
- A least-squares approach for discretizable distance geometry problems with inexact distances
- A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
Uses Software
This page was built for publication: Least-squares approximations in geometric buildup for solving distance geometry problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q637550)
