A DC programming approach for sensor network localization with uncertainties in anchor positions
From MaRDI portal
Publication:2438403
Recommendations
- Semidefinite Programming for Sensor Network and Graph Localization
- Theory of semidefinite programming for sensor network localization
- Theory of semidefinite programming for sensor network localization
- Sensor network localization with imprecise distances
- Solving the ad hoc wireless sensor network localization problem with sum of squares method
Cites work
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- A sequential convex program method to DC program with joint chance constraints
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Distance geometry optimization for protein structures
- Distributed Wireless Sensor Network Localization Via Sequential Greedy Optimization Algorithm
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- Global extremal conditions for multi-integer quadratic programming
- Optimal design and analysis of a two-hop relay network under Rayleigh fading for packet delay minimization
- Performance analysis of power save mode in IEEE 802.11 infrastructure wireless local area network
- Robust investment strategies with discrete asset choice constraints using DC programming
- Robust Localization of Nodes and Time-Recursive Tracking in Sensor Networks Using Noisy Range Measurements
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
- Semi-Definite Programming Algorithms for Sensor Network Node Localization With Uncertainties in Anchor Positions and/or Propagation Speed
- Solving partitioning-hub location-routing problem using DCA
- Source Localization Using TDOA and FDOA Measurements in the Presence of Receiver Location Errors: Analysis and Solution
- Sufficient conditions and perfect duality in nonconvex minimization with inequality constraints
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
Cited in
(11)- DC programming and DCA: thirty years of developments
- On DC based methods for phase retrieval
- D.C. programming for sparse proximal support vector machines
- A binary differential search algorithm for the 0-1 multidimensional knapsack problem
- Maximizing lifetime of a wireless sensor network via joint optimizing sink placement and sensor-to-sink routing
- The modified second APG method for DC optimization problems
- Fuzzy quadratic surface support vector machine based on Fisher discriminant analysis
- A new semi-supervised classifier based on maximum vector-angular margin
- Coordination arrival control for multi-agent systems
- A DC programming approach to the continuous equilibrium network design problem
- Robust projection twin support vector machine via DC programming
This page was built for publication: A DC programming approach for sensor network localization with uncertainties in anchor positions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2438403)
