12.07.2015 Views

v2007.09.17 - Convex Optimization

v2007.09.17 - Convex Optimization

v2007.09.17 - Convex Optimization

SHOW MORE
SHOW LESS
  • No tags were found...

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

4.4. RANK-CONSTRAINED SEMIDEFINITE PROGRAM 2711.210.80.60.40.20−0.2−0.2 0 0.2 0.4 0.6 0.8 1 1.2 1.4Figure 70: Typical solution for 4-lattice in Figure 65 with noise factorη = 0.1 . Four red vertical middle-left nodes are anchors; remaining nodesare sensors. Radio range of sensor 1 indicated by arc; radius = 0.75 . Actualsensor indicated by target while its localization is indicated by bullet • .Rank-2 solution found in 7 iterations (640) (1480a).1.210.80.60.40.20−0.2−0.2 0 0.2 0.4 0.6 0.8 1 1.2 1.4Figure 71: Typical solution for 5-lattice in Figure 66 with noise factorη = 0.1 . Five red vertical middle nodes are anchors; remaining nodes aresensors. Radio range of sensor 1 indicated by arc; radius = 0.56 . Actualsensor indicated by target while its localization is indicated by bullet • .Rank-2 solution found in 3 iterations (640) (1480a).

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!