Least-squares approximations in geometric buildup for solving distance geometry problems

DOI10.1007/S10957-011-9806-6zbMATH Open1229.90276OpenAlexW1965397948MaRDI QIDQ637550FDOQ637550

Authors: Xinlong Luo, Zhijun Wu 

Publication date: 6 September 2011

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-011-9806-6

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

zbMATH Keywords

singular value decompositionnonlinear least squaresdistance geometrybiomolecular modeling

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Applications of mathematical programming (90C90)

Cites Work

• Numerical Optimization
• Calculating the Singular Values and Pseudo-Inverse of a Matrix
• A multivariate partition approach to optimization problems
• An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
• An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
• Conditions for Unique Graph Realizations
• On the Early History of the Singular Value Decomposition
• The Molecule Problem: Exploiting Structure in Global Optimization
• Title not available (Why is that?)
• A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
• The variation of the spectrum of a normal matrix
• Title not available (Why is that?)
• Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
• Solving molecular distance geometry problems by global optimization algorithms
• Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
• Theory of semidefinite programming for sensor network localization
• The Solution of the Metric STRESS and SSTRESS Problems in Multidimensional Scaling Using Newtons Method
• A stochastic/perturbation global optimization algorithm for distance geometry problems
• Distance geometry optimization for protein structures
• A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
• A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
• A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
• Title not available (Why is that?)
• Equivalent formulations and necessary optimality conditions for the Lennard-Jones problem
• Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems

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

• Matlab

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)