v2009.01.01 - Convex Optimization
v2009.01.01 - Convex Optimization v2009.01.01 - Convex Optimization
Yes there is a great race under way to determine which important problems can be posed in a convex setting. Yet, that skill acquired by understanding the geometry and application of Convex Optimization will remain more an art for some time to come; the reason being, there is generally no unique transformation of a given problem to its convex equivalent. This means, two researchers pondering the same problem are likely to formulate the convex equivalent differently; hence, one solution is likely different from the other for the same problem. Any presumption of only one right or correct solution becomes nebulous. Study of equivalence, sameness, and uniqueness therefore pervade study of Optimization. Tremendous benefit accrues when an optimization problem can be transformed to its convex equivalent, primarily because any locally optimal solution is then guaranteed globally optimal. Solving a nonlinear system, for example, by instead solving an equivalent convex optimization problem is therefore highly preferable. 0.1 Yet it can be difficult for the engineer to apply theory without an understanding of Analysis. These pages comprise my journal over a seven year period bridging gaps between engineer and mathematician; they constitute a translation, unification, and cohering of about three hundred papers, books, and reports from several different fields of mathematics and engineering. Beacons of historical accomplishment are cited throughout. Much of what is written here will not be found elsewhere. Care to detail, clarity, accuracy, consistency, and typography accompanies removal of ambiguity and verbosity out of respect for the reader. Consequently there is much cross-referencing and background material provided in the text, footnotes, and appendices so as to be self-contained and to provide understanding of fundamental concepts. −Jon Dattorro Stanford, California 2008 0.1 That is what motivates a convex optimization known as geometric programming [52] [70] which has driven great advances in the electronic circuit design industry. [31,4.7] [214] [335] [337] [85] [154] [163] [164] [165] [166] [167] [168] [228] [229] [237] 8
Convex Optimization & Euclidean Distance Geometry 1 Overview 19 2 Convex geometry 33 2.1 Convex set . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 34 2.2 Vectorized-matrix inner product . . . . . . . . . . . . . . . . . 45 2.3 Hulls . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 55 2.4 Halfspace, Hyperplane . . . . . . . . . . . . . . . . . . . . . . 66 2.5 Subspace representations . . . . . . . . . . . . . . . . . . . . . 78 2.6 Extreme, Exposed . . . . . . . . . . . . . . . . . . . . . . . . . 83 2.7 Cones . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87 2.8 Cone boundary . . . . . . . . . . . . . . . . . . . . . . . . . . 96 2.9 Positive semidefinite (PSD) cone . . . . . . . . . . . . . . . . . 104 2.10 Conic independence (c.i.) . . . . . . . . . . . . . . . . . . . . . 126 2.11 When extreme means exposed . . . . . . . . . . . . . . . . . . 132 2.12 Convex polyhedra . . . . . . . . . . . . . . . . . . . . . . . . . 132 2.13 Dual cone & generalized inequality . . . . . . . . . . . . . . . 140 3 Geometry of convex functions 195 3.1 Convex function . . . . . . . . . . . . . . . . . . . . . . . . . . 196 3.2 Matrix-valued convex function . . . . . . . . . . . . . . . . . . 233 3.3 Quasiconvex . . . . . . . . . . . . . . . . . . . . . . . . . . . . 239 3.4 Salient properties . . . . . . . . . . . . . . . . . . . . . . . . . 242 9
- Page 1 and 2: DATTORRO CONVEX OPTIMIZATION & EUCL
- Page 3 and 4: Convex Optimization & Euclidean Dis
- Page 5 and 6: for Jennie Columba ♦ Antonio ♦
- Page 7: Prelude The constant demands of my
- Page 11 and 12: CONVEX OPTIMIZATION & EUCLIDEAN DIS
- Page 13 and 14: List of Figures 1 Overview 19 1 Ori
- Page 15 and 16: LIST OF FIGURES 15 3 Geometry of co
- Page 17 and 18: LIST OF FIGURES 17 126 Decomposing
- Page 19 and 20: Chapter 1 Overview Convex Optimizat
- Page 21 and 22: ˇx 4 ˇx 3 ˇx 2 Figure 2: Applica
- Page 23 and 24: 23 Figure 4: This coarsely discreti
- Page 25 and 26: ases (biorthogonal expansion). We e
- Page 27 and 28: 27 Figure 7: These bees construct a
- Page 29 and 30: that establish its membership to th
- Page 31 and 32: 31 appendices Provided so as to be
- Page 33 and 34: Chapter 2 Convex geometry Convexity
- Page 35 and 36: 2.1. CONVEX SET 35 2.1.2 linear ind
- Page 37 and 38: 2.1. CONVEX SET 37 2.1.6 empty set
- Page 39 and 40: 2.1. CONVEX SET 39 2.1.7.1 Line int
- Page 41 and 42: 2.1. CONVEX SET 41 (a) R 2 (b) R 3
- Page 43 and 44: 2.1. CONVEX SET 43 This theorem in
- Page 45 and 46: 2.2. VECTORIZED-MATRIX INNER PRODUC
- Page 47 and 48: 2.2. VECTORIZED-MATRIX INNER PRODUC
- Page 49 and 50: 2.2. VECTORIZED-MATRIX INNER PRODUC
- Page 51 and 52: 2.2. VECTORIZED-MATRIX INNER PRODUC
- Page 53 and 54: 2.2. VECTORIZED-MATRIX INNER PRODUC
- Page 55 and 56: 2.3. HULLS 55 Figure 16: Convex hul
- Page 57 and 58: 2.3. HULLS 57 The affine hull of tw
Yes there is a great race under way to determine which important<br />
problems can be posed in a convex setting. Yet, that skill acquired by<br />
understanding the geometry and application of <strong>Convex</strong> <strong>Optimization</strong> will<br />
remain more an art for some time to come; the reason being, there is generally<br />
no unique transformation of a given problem to its convex equivalent. This<br />
means, two researchers pondering the same problem are likely to formulate<br />
the convex equivalent differently; hence, one solution is likely different from<br />
the other for the same problem. Any presumption of only one right or correct<br />
solution becomes nebulous. Study of equivalence, sameness, and uniqueness<br />
therefore pervade study of <strong>Optimization</strong>.<br />
Tremendous benefit accrues when an optimization problem can be<br />
transformed to its convex equivalent, primarily because any locally optimal<br />
solution is then guaranteed globally optimal. Solving a nonlinear system,<br />
for example, by instead solving an equivalent convex optimization problem<br />
is therefore highly preferable. 0.1 Yet it can be difficult for the engineer to<br />
apply theory without an understanding of Analysis.<br />
These pages comprise my journal over a seven year period bridging<br />
gaps between engineer and mathematician; they constitute a translation,<br />
unification, and cohering of about three hundred papers, books, and reports<br />
from several different fields of mathematics and engineering. Beacons of<br />
historical accomplishment are cited throughout. Much of what is written here<br />
will not be found elsewhere. Care to detail, clarity, accuracy, consistency,<br />
and typography accompanies removal of ambiguity and verbosity out of<br />
respect for the reader. Consequently there is much cross-referencing and<br />
background material provided in the text, footnotes, and appendices so as<br />
to be self-contained and to provide understanding of fundamental concepts.<br />
−Jon Dattorro<br />
Stanford, California<br />
2008<br />
0.1 That is what motivates a convex optimization known as geometric programming [52]<br />
[70] which has driven great advances in the electronic circuit design industry. [31,4.7]<br />
[214] [335] [337] [85] [154] [163] [164] [165] [166] [167] [168] [228] [229] [237]<br />
8