A DC programming approach for sensor network localization with uncertainties in anchor positions
From MaRDI portal
Publication:2438403
DOI10.3934/jimo.2014.10.817zbMath1292.90314OpenAlexW1983751356MaRDI QIDQ2438403
Qiang Long, Chaojie Li, Changzhi Wu
Publication date: 11 March 2014
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2014.10.817
Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46)
Related Items (11)
A new semi-supervised classifier based on maximum vector-angular margin ⋮ Robust projection twin support vector machine via DC programming ⋮ A DC Programming Approach to the Continuous Equilibrium Network Design Problem ⋮ DC programming and DCA: thirty years of developments ⋮ A binary differential search algorithm for the 0-1 multidimensional knapsack problem ⋮ Coordination arrival control for multi-agent systems ⋮ Fuzzy quadratic surface support vector machine based on Fisher discriminant analysis ⋮ Maximizing lifetime of a wireless sensor network via joint optimizing sink placement and sensor-to-sink routing ⋮ On DC based methods for phase retrieval ⋮ D.C. programming for sparse proximal support vector machines ⋮ The modified second APG method for DC optimization problems
Uses Software
Cites Work
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- Optimal design and analysis of a two-hop relay network under Rayleigh fading for packet delay minimization
- Global extremal conditions for multi-integer quadratic programming
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Sufficient conditions and perfect duality in nonconvex minimization with inequality constraints
- Distance geometry optimization for protein structures
- Solving partitioning-hub location-routing problem using DCA
- Performance analysis of power save mode in IEEE 802.11 infrastructure wireless local area network
- A sequential convex program method to DC program with joint chance constraints
- Robust investment strategies with discrete asset choice constraints using DC programming
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- Source Localization Using TDOA and FDOA Measurements in the Presence of Receiver Location Errors: Analysis and Solution
- Distributed Wireless Sensor Network Localization Via Sequential Greedy Optimization Algorithm
- Semi-Definite Programming Algorithms for Sensor Network Node Localization With Uncertainties in Anchor Positions and/or Propagation Speed
- Robust Localization of Nodes and Time-Recursive Tracking in Sensor Networks Using Noisy Range Measurements
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
This page was built for publication: A DC programming approach for sensor network localization with uncertainties in anchor positions
