1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto...
-
Upload
magnus-ramsey -
Category
Documents
-
view
213 -
download
0
Transcript of 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto...
![Page 1: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/1.jpg)
1
Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization
Makoto YamashitaMasakazu Kojima Tokyo Institute of Technology
![Page 2: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/2.jpg)
2
Motivation from Sensor Network Localization Problem
If positions are known, computing distances is easy
Reverse is difficult To obtain the positions of
sensors, we need to solve
6 7
98
Anchor
3
4
2
51
Sensors
![Page 3: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/3.jpg)
3
SDP relaxation (by Biswas&Ye,2004)
Lifting
SDP Relaxation determines locations uniquely under some condition.
Edge sets
![Page 4: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/4.jpg)
4
Region of solutions SNL sometimes
has multiple solutions
Interior-Point Methods generate a center point
We estimate the regions of solutions by SDP
4 5
76
1
2
3
3’
3
mirroring
![Page 5: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/5.jpg)
5
Example of SNL1. Input network2. SDP solution3. Ellipsoids
difficult sensors
Difference of true locationand SDP solution
solved by SFSDP (Kim et al, 2008) http://www.is.titech.ac.jp/~kojima/SFSDP/SFSDP.htmlwith SDPA 7 (Yamashita et al, 2009)http://sdpa.indsys.chuo-u.ac.jp/sdpa/
![Page 6: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/6.jpg)
6
General concept in Polynomial Optimization Problem
min
Optimal
SDP relaxation(convex region)
SDP solution
Local adjustmentfor feasible region
Optimal solutions exist in this ellipsoid.We compute this ellipsoid by SDP.
Feasible region
Semi-algebraic Sets
(Polynomials)
![Page 7: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/7.jpg)
7
Ellipsoid research .
MVEE (the minimum volume enclosing ellipsoid)
Our approach by SDP relaxation
Solvable by SDP Small computation cost
⇒We can execute multiple times changing
![Page 8: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/8.jpg)
8
Mathematical Formulation . Ellipsoid
with
We want to compute
By some steps, we consider SDP relaxation
![Page 9: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/9.jpg)
9
Lifting
.
.
Note that Furthermore
⇒
quadratic
linear (easier)
Still difficult
(convex hull)
![Page 10: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/10.jpg)
10
SDP relaxation
. .
relaxation
![Page 11: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/11.jpg)
11
. .
Gradient Optimal attained at
.
Cover
Inner minimization
![Page 12: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/12.jpg)
12
Relations of
![Page 13: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/13.jpg)
13
Numerical Results on SNL We solve
for each sensor by Each SDP is solved quickly.
#anchor = 4, #sensor = 100, #edge = 366 0.65 second for each (65 seconds for 100 sensors)
#anchor = 4, #sensor = 500, #edge = 1917 5.6 second for each (2806 seconds for 500 sensors)
SFSDP & SDPA on Xeon 5365(3.0GHz, 48GB) Sparsity technique is very important
![Page 14: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/14.jpg)
14
Results (#sensor = 100)
![Page 15: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/15.jpg)
15
Diff v.s. Radius
Ellipsoids cover true locations
![Page 16: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/16.jpg)
16
More edges case
If SDP solution is good, radius is very small.
![Page 17: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/17.jpg)
17
Example from POP ex9_1_2 from GLOBAL library
(http://www.gamsworld.org/global/global.htm)
We use SparsePOP to solve this by SDP relaxation
SparsePOPhttp://www.is.titech.ac.jp/~kojima/SparsePOP/SparsePOP.html
![Page 18: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/18.jpg)
18
Region of the Solution
![Page 19: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/19.jpg)
19
Reduced POP
Optimal Solutions:
![Page 20: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/20.jpg)
20
Ellipsoids for Reduced SDP
Optimal Solutions:
Very tight bound
![Page 21: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/21.jpg)
21
Results on POP
Very good objective values ex_9_1_2 & ex_9_1_8 have multiple optimal
solutions ⇒ large radius
![Page 22: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/22.jpg)
22
Conclusion & Future works An enclosing ellipsoid by SDP relaxation
Bound the locations of sensors Improve the SDP solution of POP Very low computation cost
Ellipsoid becomes larger for unconnected sensors
Successive ellipsoid for POP sometimes stops before bounding the region appropriately
![Page 23: 1 Enclosing Ellipsoids of Semi-algebraic Sets and Error Bounds in Polynomial Optimization Makoto Yamashita Masakazu Kojima Tokyo Institute of Technology.](https://reader035.fdocuments.us/reader035/viewer/2022062519/5697bfc31a28abf838ca5535/html5/thumbnails/23.jpg)
23
This talk is based on the following technical paperMasakazu Kojima and Makoto Yamashita,“Enclosing Ellipsoids and Elliptic Cylinders of Semialgebraic Sets and Their Application to Error Boundsin Polynomial Optimization”, Research Report B-459, Dept. of Math. and Comp. Sciences,Tokyo Institute of Technology, Oh-Okayama, Meguro, Tokyo 152-8552,January 2010.