SNLSDP

swMATH5127MaRDI QIDQ17267

No author found.

Related Items (39)

A block coordinate descent method for sensor network localization ⋮ Convex optimization learning of faithful Euclidean distance representations in nonlinear dimensionality reduction ⋮ Sum of squares method for sensor network localization ⋮ A Nonmonotone Alternating Updating Method for a Class of Matrix Factorization Problems ⋮ Sensor network localization, Euclidean distance matrix completions, and graph realization ⋮ Input design for discrimination between classes of LTI models ⋮ Approximation accuracy, gradient methods, and error bound for structured convex optimization ⋮ Feasibility and a fast algorithm for Euclidean distance matrix optimization with ordinal constraints ⋮ Noisy Euclidean Distance Realization: Robust Facial Reduction and the Pareto Frontier ⋮ A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem ⋮ Angular synchronization by eigenvectors and semidefinite programming ⋮ Solving Partial Differential Equations on Manifolds From Incomplete Interpoint Distance ⋮ Linearized proximal algorithms with adaptive stepsizes for convex composite optimization with applications ⋮ A DC programming approach for sensor network localization with uncertainties in anchor positions ⋮ (Robust) edge-based semidefinite programming relaxation of sensor network localization ⋮ Computing the nearest Euclidean distance matrix with low embedding dimensions ⋮ Robust Euclidean embedding via EDM optimization ⋮ On distributed localization for road sensor networks: a game theoretic approach ⋮ Level-set methods for convex optimization ⋮ QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming ⋮ Max-norm optimization for robust matrix recovery ⋮ New error measures and methods for realizing protein graphs from distance data ⋮ Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints ⋮ The discretizable molecular distance geometry problem ⋮ SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization ⋮ Canonical dual least square method for solving general nonlinear systems of quadratic equations ⋮ Exploiting Sparsity in SDP Relaxation for Sensor Network Localization ⋮ Euclidean distance matrices, semidefinite programming and sensor network localization ⋮ Second‐Order Cone Programming Relaxation of Sensor Network Localization ⋮ On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications ⋮ 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 ⋮ A Euclidean distance matrix model for protein molecular conformation ⋮ Finding Low-Rank Solutions via Nonconvex Matrix Factorization, Efficiently and Provably ⋮ Sparse SOS Relaxations for Minimizing Functions that are Summations of Small Polynomials ⋮ ASAP: An Eigenvector Synchronization Algorithm for the Graph Realization Problem ⋮ Using a Distributed SDP Approach to Solve Simulated Protein Molecular Conformation Problems ⋮ An Iterative Rank Penalty Method for Nonconvex Quadratically Constrained Quadratic Programs ⋮ Global Registration of Multiple Point Clouds Using Semidefinite Programming

This page was built for software: SNLSDP