v2007.09.13 - Convex Optimization
v2007.09.13 - Convex Optimization v2007.09.13 - Convex Optimization
270 CHAPTER 4. SEMIDEFINITE PROGRAMMING1.210.80.60.40.20−0.2−0.5 0 0.5 1 1.5 2Figure 68: Typical solution for 2-lattice in Figure 63 with noise factorη = 0.1 . Two red rightmost nodes are anchors; two remaining nodes aresensors. Radio range of sensor 1 indicated by arc; radius = 1.14 . Actualsensor indicated by target while its localization is indicated by bullet • .Rank-2 solution found in 1 iteration (640) (1475a) subject to reflection error.1.210.80.60.40.20−0.2−0.2 0 0.2 0.4 0.6 0.8 1 1.2 1.4Figure 69: Typical solution for 3-lattice in Figure 64 with noise factorη = 0.1 . Three red vertical middle nodes are anchors; remaining nodes aresensors. Radio range of sensor 1 indicated by arc; radius = 1.12 . Actualsensor indicated by target while its localization is indicated by bullet • .Rank-2 solution found in 2 iterations (640) (1475a).
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) (1475a).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) (1475a).
- Page 219 and 220: 3.2. MATRIX-VALUED CONVEX FUNCTION
- Page 221 and 222: 3.3. QUASICONVEX 221A quasiconcave
- Page 223 and 224: 3.4. SALIENT PROPERTIES 2236.A nonn
- Page 225 and 226: Chapter 4Semidefinite programmingPr
- Page 227 and 228: 4.1. CONIC PROBLEM 227where K is a
- Page 229 and 230: 4.1. CONIC PROBLEM 229C0PΓ 1Γ 2S+
- Page 231 and 232: 4.1. CONIC PROBLEM 231faces of S 3
- Page 233 and 234: 4.1. CONIC PROBLEM 2334.1.1.3 Previ
- Page 235 and 236: 4.2. FRAMEWORK 235Equivalently, pri
- Page 237 and 238: 4.2. FRAMEWORK 237is positive semid
- Page 239 and 240: 4.2. FRAMEWORK 239Optimal value of
- Page 241 and 242: 4.2. FRAMEWORK 2414.2.3.0.2 Example
- Page 243 and 244: 4.2. FRAMEWORK 243where δ is the m
- Page 245 and 246: 4.2. FRAMEWORK 2454.2.3.0.3 Example
- Page 247 and 248: 4.3. RANK REDUCTION 2474.3 Rank red
- Page 249 and 250: 4.3. RANK REDUCTION 249A rank-reduc
- Page 251 and 252: 4.3. RANK REDUCTION 251(t ⋆ i)
- Page 253 and 254: 4.3. RANK REDUCTION 2534.3.3.0.1 Ex
- Page 255 and 256: 4.3. RANK REDUCTION 2554.3.3.0.2 Ex
- Page 257 and 258: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 259 and 260: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 261 and 262: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 263 and 264: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 265 and 266: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 267 and 268: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 269: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 273 and 274: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 275 and 276: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 277 and 278: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 279 and 280: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 281 and 282: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 283 and 284: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 285 and 286: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 287 and 288: 4.4. RANK-CONSTRAINED SEMIDEFINITE
- Page 289 and 290: Chapter 5Euclidean Distance MatrixT
- Page 291 and 292: 5.2. FIRST METRIC PROPERTIES 291cor
- Page 293 and 294: 5.3. ∃ FIFTH EUCLIDEAN METRIC PRO
- Page 295 and 296: 5.3. ∃ FIFTH EUCLIDEAN METRIC PRO
- Page 297 and 298: 5.4. EDM DEFINITION 297The collecti
- Page 299 and 300: 5.4. EDM DEFINITION 2995.4.2 Gram-f
- Page 301 and 302: 5.4. EDM DEFINITION 301D ∈ EDM N
- Page 303 and 304: 5.4. EDM DEFINITION 3035.4.2.2.1 Ex
- Page 305 and 306: 5.4. EDM DEFINITION 305ten affine e
- Page 307 and 308: 5.4. EDM DEFINITION 307spheres:Then
- Page 309 and 310: 5.4. EDM DEFINITION 309By eliminati
- Page 311 and 312: 5.4. EDM DEFINITION 311whereΦ ij =
- Page 313 and 314: 5.4. EDM DEFINITION 3135.4.2.2.5 De
- Page 315 and 316: 5.4. EDM DEFINITION 315105ˇx 4ˇx
- Page 317 and 318: 5.4. EDM DEFINITION 317corrected by
- Page 319 and 320: 5.4. EDM DEFINITION 319aptly be app
270 CHAPTER 4. SEMIDEFINITE PROGRAMMING1.210.80.60.40.20−0.2−0.5 0 0.5 1 1.5 2Figure 68: Typical solution for 2-lattice in Figure 63 with noise factorη = 0.1 . Two red rightmost nodes are anchors; two remaining nodes aresensors. Radio range of sensor 1 indicated by arc; radius = 1.14 . Actualsensor indicated by target while its localization is indicated by bullet • .Rank-2 solution found in 1 iteration (640) (1475a) subject to reflection error.1.210.80.60.40.20−0.2−0.2 0 0.2 0.4 0.6 0.8 1 1.2 1.4Figure 69: Typical solution for 3-lattice in Figure 64 with noise factorη = 0.1 . Three red vertical middle nodes are anchors; remaining nodes aresensors. Radio range of sensor 1 indicated by arc; radius = 1.12 . Actualsensor indicated by target while its localization is indicated by bullet • .Rank-2 solution found in 2 iterations (640) (1475a).
Change language