The following pages link to SNLSDP (Q17267):
Displaying 39 items.
- Sensor network localization, Euclidean distance matrix completions, and graph realization (Q374660) (← links)
- Computing the nearest Euclidean distance matrix with low embedding dimensions (Q463737) (← links)
- On distributed localization for road sensor networks: a game theoretic approach (Q474459) (← links)
- New error measures and methods for realizing protein graphs from distance data (Q517453) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- Angular synchronization by eigenvectors and semidefinite programming (Q617701) (← links)
- (Robust) edge-based semidefinite programming relaxation of sensor network localization (Q652286) (← links)
- Max-norm optimization for robust matrix recovery (Q681486) (← links)
- Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints (Q694528) (← links)
- The discretizable molecular distance geometry problem (Q694593) (← links)
- Canonical dual least square method for solving general nonlinear systems of quadratic equations (Q711390) (← links)
- Euclidean distance matrices, semidefinite programming and sensor network localization (Q716240) (← links)
- Sum of squares method for sensor network localization (Q839485) (← links)
- A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem (Q1685585) (← links)
- Level-set methods for convex optimization (Q1739042) (← links)
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming (Q1741120) (← links)
- A block coordinate descent method for sensor network localization (Q2119759) (← links)
- Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints (Q2181603) (← links)
- Robust Euclidean embedding via EDM optimization (Q2220896) (← links)
- A Euclidean distance matrix model for protein molecular conformation (Q2307747) (← links)
- Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction (Q2364497) (← links)
- Input design for discrimination between classes of LTI models (Q2409415) (← links)
- A DC programming approach for sensor network localization with uncertainties in anchor positions (Q2438403) (← links)
- Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications (Q2694483) (← links)
- On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications (Q2810547) (← links)
- ASAP: An Eigenvector Synchronization Algorithm for the Graph Realization Problem (Q2841706) (← links)
- Using a Distributed SDP Approach to Solve Simulated Protein Molecular Conformation Problems (Q2841714) (← links)
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization (Q3629511) (← links)
- A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation (Q3630370) (← links)
- Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials (Q3648519) (← links)
- A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems (Q4562251) (← links)
- Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier (Q4588863) (← links)
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization (Q5189557) (← links)
- Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably (Q5230407) (← links)
- An Iterative Rank Penalty Method for Nonconvex Quadratically Constrained Quadratic Programs (Q5244155) (← links)
- Global Registration of Multiple Point Clouds Using Semidefinite Programming (Q5252586) (← links)
- Solving Partial Differential Equations on Manifolds From Incomplete Interpoint Distance (Q5364201) (← links)
- SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization (Q5426899) (← links)
- Second‐Order Cone Programming Relaxation of Sensor Network Localization (Q5444286) (← links)
