SNLSDP
From MaRDI portal
Cited in
(51)- Finding low-rank solutions via nonconvex matrix factorization, efficiently and provably
- Computing the nearest Euclidean distance matrix with low embedding dimensions
- Angular synchronization by eigenvectors and semidefinite programming
- Solving partial differential equations on manifolds from incomplete interpoint distance
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
- Sum of squares method for sensor network localization
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Global registration of multiple point clouds using semidefinite programming
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- A block coordinate descent method for sensor network localization
- The discretizable molecular distance geometry problem
- A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem
- Max-norm optimization for robust matrix recovery
- Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints
- Euclidean distance matrices, semidefinite programming and sensor network localization
- A DC programming approach for sensor network localization with uncertainties in anchor positions
- ASAP: an eigenvector synchronization algorithm for the graph realization problem
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials
- SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization
- Robust Euclidean embedding via EDM optimization
- A Euclidean distance matrix model for protein molecular conformation
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- Canonical dual least square method for solving general nonlinear systems of quadratic equations
- On convergence rates of linearized proximal algorithms for convex composite optimization with applications
- QSDP
- SFSDP
- smacof
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- MD-jeep
- Trilater.c
- DISCO
- QSDPNAL
- Enron Email Dataset
- Frey Face
- EASAL
- ADMM_QAP
- Sieve-SDP
- A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
- Using a distributed SDP approach to solve simulated protein molecular conformation problems
- Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints
- New error measures and methods for realizing protein graphs from distance data
- An iterative rank penalty method for nonconvex quadratically constrained quadratic programs
- Input design for discrimination between classes of LTI models
- A nonmonotone alternating updating method for a class of matrix factorization problems
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications
- Level-set methods for convex optimization
- On distributed localization for road sensor networks: a game theoretic approach
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction
This page was built for software: SNLSDP
