A Maximum-Likelihood TDOA Localization Algorithm Using Difference-of-Convex Programming

Computer Science

• Objective Function 100%
• Time Difference 80%
• Convex Programming 60%
• Algorithms 40%
• Benchmark 20%
• Convergence 20%
• Rao Lower Bound 20%
• Performance Loss 20%
• Localization Problem 20%
• Source Location 20%
• Convex Relaxation 20%
• Maximum Likelihood Method 20%
• Convex Function 20%
• Process Optimization 20%
• Popular Approach 20%
• Stationary Point 20%
• Optimization Task 20%
• Simulation 20%
• Standards 20%
• Approximation (Algorithm) 20%
• Iterative Algorithm 20%
• Convex Hull 20%
• Convex Optimization 20%