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

DOI10.1007/s10957-011-9806-6zbMath1229.90276MaRDI QIDQ637550

Xin-long Luo, Zhi-jun 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

zbMATH Keywords

singular value decomposition; distance geometry; nonlinear least squares; biomolecular modeling

Mathematics Subject Classification ID

90C90: Applications of mathematical programming

90C59: Approximation methods and heuristics in mathematical programming

Related Items

A least-squares approach for discretizable distance geometry problems with inexact distances

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equivalent formulations and necessary optimality conditions for the Lennard-Jones problem
• A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
• Solving molecular distance geometry problems by global optimization algorithms
• Theory of semidefinite programming for sensor network localization
• A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
• 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
• A multivariate partition approach to optimization problems
• A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
• Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems
• Distance geometry optimization for protein structures
• An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
• The variation of the spectrum of a normal matrix
• An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
• Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
• A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
• Conditions for Unique Graph Realizations
• Numerical Optimization
• On the Early History of the Singular Value Decomposition
• Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
• The Molecule Problem: Exploiting Structure in Global Optimization
• Calculating the Singular Values and Pseudo-Inverse of a Matrix