Multiscale semidefinite programming approach to positioning problems with pairwise structure
From MaRDI portal
Publication:6629219
DOI10.1007/s10915-024-02676-1MaRDI QIDQ6629219
Yuehaw Khoo, Yi-An Chen, Michael Lindsey
Publication date: 29 October 2024
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Mathematical programming (90Cxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx) Manifolds and measure-geometric topics (49Qxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
- Sum of squares method for sensor network localization
- Theory of semidefinite programming for sensor network localization
- The crystallization conjecture: a review
- Semidefinite programming relaxations for semialgebraic problems
- Mutual interactions, potentials, and individual distance in a social aggregation
- Global optimization with polynomials and the problem of moments
- .879-approximation algorithms for MAX CUT and MAX 2SAT
- Some NP-complete problems in quadratic and nonlinear programming
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- Variational Embedding for Quantum Many‐Body Problems
- Semidefinite Relaxation of Multimarginal Optimal Transport for Strictly Correlated Electrons in Second Quantization
- Convex Relaxation Approaches for Strictly Correlated Density Functional Theory
- SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization
- Fast global optimization of difficult Lennard-Jones clusters
This page was built for publication: Multiscale semidefinite programming approach to positioning problems with pairwise structure
