SNLSDP

swMATH5127MaRDI QIDQ17267FDOQ17267

Author name not available (Why is that?)

Cited In (39)

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

This page was built for software: SNLSDP