Solution of network localization problem with noisy distances and its convergence

11/20/2017
by   Ananya Saha, et al.
0

The network localization problem with convex and non-convex distance constraints may be modeled as a nonlinear optimization problem. The existing localization techniques are mainly based on convex optimization. In those techniques, the non-convex distance constraints are either ignored or relaxed into convex constraints for using the convex optimization methods like SDP, least square approximation, etc.. We propose a method to solve the nonlinear non-convex network localization problem with noisy distance measurements without any modification of constraints in the general model. We use the nonlinear Lagrangian technique for non-convex optimization to convert the problem to a root finding problem of a single variable continuous function. This problem is then solved using an iterative method. However, in each step of the iteration the computation of the functional value involves a finite mini-max problem (FMX). We use smoothing gradient method to fix the FMX problem. We also prove that the solution obtained from the proposed iterative method converges to the actual solution of the general localization problem. The proposed method obtains the solutions with a desired label of accuracy in real time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/28/2022

Simplifying deflation for non-convex optimization with applications in Bayesian inference and topology optimization

Non-convex optimization problems have multiple local optimal solutions. ...
research
09/09/2022

Safe and Smooth: Certified Continuous-Time Range-Only Localization

A common approach to localize a mobile robot is by measuring distances t...
research
04/16/2018

Using Convex Optimization of Autocorrelation with Constrained Support and Windowing for Improved Phase Retrieval Accuracy

In imaging modalities recording diffraction data, the original image can...
research
10/04/2018

Seamless Parametrization with Arbitrarily Prescribed Cones

Seamless global parametrization of surfaces is a key operation in geomet...
research
06/02/2023

On the minimum information checkerboard copulas under fixed Kendall's rank correlation

Copulas have become very popular as a statistical model to represent dep...
research
05/04/2018

A Convex Approximation of the Relaxed Binaural Beamforming Optimization Problem

The recently proposed relaxed binaural beamforming (RBB) optimization pr...
research
10/27/2018

Using Fractional Programming for Zero-Norm Approximation

This paper proposes the use of fractional programming (FP) to solve prob...

Please sign up or login with your details

Forgot password? Click here to reset