Proving Strong Duality for Geometric Optimization Using a Conic Formulation
- 115 Downloads
Geometric optimization1 is an important class of problems that has many applications, especially in engineering design. In this article, we provide new simplified proofs for the well-known associated duality theory, using conic optimization. After introducing suitable convex cones and studying their properties, we model geometric optimization problems with a conic formulation, which allows us to apply the powerful duality theory of conic optimization and derive the duality results valid for geometric optimization.
Unable to display preview. Download preview PDF.
- D. den Hertog, F. Jarre, C. Roos and T. Terlaky, A sufficient condition for self-concordance, with application to some classes of structured convex programming problems, Mathematical Programming 69 (1995) 75–88.Google Scholar
- R.J. Duffin, E.L. Peterson and C. Zener, Geometric Programming (Wiley, New York, 1967).Google Scholar
- A.J. Goldman and A.W. Tucker, Theory of linear programming, in: Linear Equalities and Related Systems, eds. H.W. Kuhn and A.W. Tucker, Annals of Mathematical Studies, Vol. 38 (Princeton University Press, Princeton, NJ, 1956) pp. 53–97.Google Scholar
- E. Klafszky, Geometric programming and some applications, Ph.D. thesis, Tanulmányok, No. 8 (1974).Google Scholar
- E. Klafszky, Geometric Programming, Seminar Notes, no. 11.976, Hungarian Committee for Systems Analysis, Budapest (1976).Google Scholar
- Y.E. Nesterov and A.S. Nemirovsky, Interior-Point Polynomial Methods in Convex Programming, SIAM Studies in Applied Mathematics (SIAM Publications, Philadelphia, 1994).Google Scholar
- R.T. Rockafellar, Convex Analysis (Princeton University Press, Princeton, NJ, 1970).Google Scholar
- R.T. Rockafellar, Some convex programs whose duals are linearly constrained, in: Non-Linear Programming, ed. J.B. Rosen (Academic Press, 1970).Google Scholar
- J. Stoer and Ch.Witzgall, Convexity and Optimization in Finite Dimensions I (Springer, Berlin, 1970).Google Scholar
- J.F. Sturm, Primal-dual interior-point approach to semidefinite programming, Ph.D. thesis, Erasmus Universiteit Rotterdam, The Netherlands (1997) published in .Google Scholar
- J.F. Sturm, Duality results, in: High Performance Optimization, eds. H. Frenk, C. Roos, T. Terlaky and S. Zhang (Kluwer Academic, 2000) pp. 21-60.Google Scholar