Pages that link to "Item:Q3629511"
From MaRDI portal
The following pages link to Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization (Q3629511):
Displaying 22 items.
- Sensor network localization, Euclidean distance matrix completions, and graph realization (Q374660) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- Least-squares approximations in geometric buildup for solving distance geometry problems (Q637550) (← links)
- (Robust) edge-based semidefinite programming relaxation of sensor network localization (Q652286) (← links)
- Comparing SOS and SDP relaxations of sensor network localization (Q694515) (← links)
- Edge-based semidefinite programming relaxation of sensor network localization with lower bound constraints (Q694528) (← links)
- On bar frameworks, stress matrices and semidefinite programming (Q717126) (← links)
- Semidefinite programming for approximate maximum likelihood sinusoidal parameter estimation (Q983740) (← links)
- Accurate time delay estimation based passive localization (Q1032357) (← links)
- A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem (Q1685585) (← links)
- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures (Q1730533) (← links)
- Visualizing data as objects by DC (difference of convex) optimization (Q1749447) (← links)
- Geometric buildup algorithms for sensor network localization (Q1955353) (← links)
- A block coordinate descent method for sensor network localization (Q2119759) (← links)
- Optimization and operations research in mitigation of a pandemic (Q2158111) (← links)
- Robust Euclidean embedding via EDM optimization (Q2220896) (← links)
- Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation (Q2397097) (← links)
- A DC programming approach for sensor network localization with uncertainties in anchor positions (Q2438403) (← links)
- Euclidean Distance Matrices and Applications (Q2802549) (← links)
- On Convergence Rates of Linearized Proximal Algorithms for Convex Composite Optimization with Applications (Q2810547) (← links)
- Optimal partial discretization orders for discretizable distance geometry (Q2827765) (← links)
- Localization in wireless sensor networks: Classification and evaluation of techniques (Q5403364) (← links)