v2007.09.13 - Convex Optimization

v2007.09.13 - Convex Optimization v2007.09.13 - Convex Optimization

convexoptimization.com
from convexoptimization.com More from this publisher
10.07.2015 Views

There is a great race under way to determine which important problemscan be posed in a convex setting. Yet, that skill acquired by understandingthe geometry and application of Convex Optimization will remain more anart for some time to come; the reason being, there is generally no uniquetransformation of a given problem to its convex equivalent. This means, tworesearchers pondering the same problem are likely to formulate the convexequivalent differently; hence, one solution is likely different from the otherfor the same problem. Any presumption of only one right or correct solutionbecomes nebulous. Study of equivalence, sameness, and uniqueness thereforepervade study of Optimization.Tremendous benefit accrues when an optimization problem can betransformed to its convex equivalent, primarily because any locally optimalsolution is then guaranteed globally optimal. Solving a nonlinear system,for example, by instead solving an equivalent convex optimization problemis therefore highly preferable. 0.1 Yet it can be difficult for the engineer toapply theory without an understanding of Analysis.These pages comprise my journal over a seven year period bridginggaps between engineer and mathematician; they constitute a translation,unification, and cohering of about two hundred papers, books, and reportsfrom several different fields of mathematics and engineering. Beaconsof historical accomplishment are cited throughout. Much of what iswritten here will not be found elsewhere. Care to detail, clarity, accuracy,consistency, and typography accompanies removal of ambiguity andverbosity. Consequently there is much cross-referencing and backgroundmaterial provided in the text, footnotes, and appendices so as to beself-contained and to provide understanding of fundamental concepts.−Jon DattorroStanford, California20070.1 That is what motivates a convex optimization known as geometric programming[46, p.188] [45] which has driven great advances in the electronic circuit design industry.[27,4.7] [180] [288] [291] [67] [129] [137] [138] [139] [140] [141] [142] [192] [193] [201]8

Convex Optimization&Euclidean Distance Geometry1 Overview 192 Convex geometry 332.1 Convex set . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 342.2 Vectorized-matrix inner product . . . . . . . . . . . . . . . . . 452.3 Hulls . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 532.4 Halfspace, Hyperplane . . . . . . . . . . . . . . . . . . . . . . 592.5 Subspace representations . . . . . . . . . . . . . . . . . . . . . 732.6 Extreme, Exposed . . . . . . . . . . . . . . . . . . . . . . . . . 762.7 Cones . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 812.8 Cone boundary . . . . . . . . . . . . . . . . . . . . . . . . . . 902.9 Positive semidefinite (PSD) cone . . . . . . . . . . . . . . . . . 972.10 Conic independence (c.i.) . . . . . . . . . . . . . . . . . . . . . 1202.11 When extreme means exposed . . . . . . . . . . . . . . . . . . 1262.12 Convex polyhedra . . . . . . . . . . . . . . . . . . . . . . . . . 1262.13 Dual cone & generalized inequality . . . . . . . . . . . . . . . 1343 Geometry of convex functions 1833.1 Convex function . . . . . . . . . . . . . . . . . . . . . . . . . . 1843.2 Matrix-valued convex function . . . . . . . . . . . . . . . . . . 2143.3 Quasiconvex . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2203.4 Salient properties . . . . . . . . . . . . . . . . . . . . . . . . . 2229

There is a great race under way to determine which important problemscan be posed in a convex setting. Yet, that skill acquired by understandingthe geometry and application of <strong>Convex</strong> <strong>Optimization</strong> will remain more anart for some time to come; the reason being, there is generally no uniquetransformation of a given problem to its convex equivalent. This means, tworesearchers pondering the same problem are likely to formulate the convexequivalent differently; hence, one solution is likely different from the otherfor the same problem. Any presumption of only one right or correct solutionbecomes nebulous. Study of equivalence, sameness, and uniqueness thereforepervade study of <strong>Optimization</strong>.Tremendous benefit accrues when an optimization problem can betransformed to its convex equivalent, primarily because any locally optimalsolution is then guaranteed globally optimal. Solving a nonlinear system,for example, by instead solving an equivalent convex optimization problemis therefore highly preferable. 0.1 Yet it can be difficult for the engineer toapply theory without an understanding of Analysis.These pages comprise my journal over a seven year period bridginggaps between engineer and mathematician; they constitute a translation,unification, and cohering of about two hundred papers, books, and reportsfrom several different fields of mathematics and engineering. Beaconsof historical accomplishment are cited throughout. Much of what iswritten here will not be found elsewhere. Care to detail, clarity, accuracy,consistency, and typography accompanies removal of ambiguity andverbosity. Consequently there is much cross-referencing and backgroundmaterial provided in the text, footnotes, and appendices so as to beself-contained and to provide understanding of fundamental concepts.−Jon DattorroStanford, California20070.1 That is what motivates a convex optimization known as geometric programming[46, p.188] [45] which has driven great advances in the electronic circuit design industry.[27,4.7] [180] [288] [291] [67] [129] [137] [138] [139] [140] [141] [142] [192] [193] [201]8

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

Saved successfully!

Ooh no, something went wrong!