Pratik Biswas

Semidefinite Programming Approaches to Distance Geometry Problems

  • Pratik Biswas
    • Categories Global Optimization Applications, Semi-definite Programming Tags , , ,

    Given a subset of all the pair-wise distances between a set of points in a fixed dimension, and possibly the positions of few of the points (called anchors), can we estimate the (relative) positions of all the unknown points (in the given dimension) accurately? This problem is known as the Euclidean Distance Geometry or Graph … Read more

    Semidefinite Programming Based Algorithms for Sensor Network Localization

  • Pratik Biswas
  • Yinyu Ye
  • Tzu-Chen Liang
  • Ta-Chung Wang
    • Categories Applications - Science and Engineering, Multidisciplinary Design Optimization, Semi-definite Programming Tags

    An SDP relaxation based method is developed to solve the localization problem in sensor networks using incomplete and inaccurate distance information. The problem is set up to find a set of sensor positions such that given distance constraints are satisfied. The nonconvex constraints in the formulation are then relaxed in order to yield a semidefinite … Read more