# Universal duality in conic convex optimization

- 134 Downloads
- 3 Citations

## Abstract

Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both problems are infeasible, in which case the optimal values are +∞ and −∞. In contrast, for optimization problems over nonpolyhedral convex cones, a nonzero duality gap can exist when either the primal or the dual is feasible.

For a pair of dual conic convex programs, we provide simple conditions on the ``constraint matrices'' and cone under which the duality gap is zero for *every* choice of linear objective function and constraint right-hand side. We refer to this property as ``universal duality''. Our conditions possess the following properties: (i) they are necessary and sufficient, in the sense that if (and only if) they do not hold, the duality gap is nonzero for some linear objective function and constraint right-hand side; (ii) they are metrically and topologically generic; and (iii) they can be verified by solving a single conic convex program. We relate to universal duality the fact that the feasible sets of a primal convex program and its dual cannot both be bounded, unless they are both empty. Finally we illustrate our theory on a class of semidefinite programs that appear in control theory applications.

## Keywords

Conic Convex Optimization Constraint Qualification Duality Gap Universal Duality Generic Property## Preview

Unable to display preview. Download preview PDF.

## References

- 1.Absil, P.-A., Mahony, R., Sepulchre, R.: Riemannian geometry of Grassmann manifolds with a view on algorithmic computation. Acta Appl. Math.
**80**(2), 199–220 (2004)MathSciNetCrossRefGoogle Scholar - 2.Alizadeh, F., Haeberly, J.-P.A., Overton, M.L.: Complementarity and nondegeneracy in semidefinite programming. Math. Programming Mathematical Programming
**77**(2 Ser. B), 111–128 (1997)Google Scholar - 3.Berman, A.: Cones, Matrices and Mathematical Programming. Springer-Verlag, Berlin, 1973. Lecture Notes in Economics and Mathematical Systems Vol. 79Google Scholar
- 4.Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge, University Press, 2004Google Scholar
- 5.Duffin, R.J.: Clark's Theorem on linear programs holds for convex programs. Proc. Nat. Acad. Sci. U.S.A.,
**75**(4), 1624–1626 (1978)MathSciNetCrossRefGoogle Scholar - 6.Edelman, A., Arias T.A., Smith S.T. The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl.
**20**(2), 303–353 (1998)Google Scholar - 7.Ewald, G.: Combinatorial Convexity and Algebraic Geometry, volume 168 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1996Google Scholar
- 8.Halmos, P.R.: Measure Theory. D. Van Nostrand Company Inc., 1950Google Scholar
- 9.Luo, Z.-Q., Sturm, J.F., Zhang S.: Conic convex programming and self-dual embedding. Optim. Methods Softw.
**14**(3), 169–218 (2000)Google Scholar - 10.Mangasarian, O.L.: Nonlinear Programming, volume 10 of Classics in Applied Mathematics, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1994 Reprint of the 1969 originalGoogle Scholar
- 11.Pataki, G.: On the closedness of the linear image of a closed convex cone. Research Report TR-02-3, Department of Operations Research, University of North Carolina, Chapel Hill, 2003; Math. Oper. Res., to appearGoogle Scholar
- 12.Pataki, G., Tunçel, L.: On the generic properties of convex optimization problems in conic form. Math. Programming.
**89**(3 Ser. A), 449–457 (2001)Google Scholar - 13.Renegar, J.: A Mathematical View of Interior-Point Methods in Convex Optimization. MPS/SIAM Series on Optimization. Society for Industrial and Applied Mathematics, Philadelphia, PA, 2001Google Scholar
- 14.Rockafellar, R.T.: Convex Analysis. Princeton Landmarks in Mathematics. Princeton University Press, Princeton, NJ, 1997 Reprint of the 1970 originalGoogle Scholar
- 15.Rogers, C.A.: Hausdorff Measures. Cambridge University Press, London, 1970Google Scholar
- 16.Royden, H.L.: Real Analysis (second edition). The Macmillan Co., New York, 1968Google Scholar
- 17.Schneider, R.: Convex Bodies: the Brunn-Minkowski Theory, Volume 44 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, 1993Google Scholar
- 18.Schrijver, A.: Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics. John Wiley & Sons, New York, 1986.Google Scholar
- 19.Smirnov, S.: Functional Analysis lecture notes. http://www.math.kth.se/~stas/fa00/part1.ps, 2000
- 20.Todd, M.: Semidefinite optimization. Acta Numerica,
**10**, 515–560 (2001)MathSciNetCrossRefzbMATHGoogle Scholar - 21.Vandenberghe, L., Balakrishnan, V.: Semidefinite programming duality and linear system theory: connections and implications for computation. In: Proc. IEEE Conference on Decision and Control, Phoneix, AZ, 1999, pp. 989–994Google Scholar
- 22.Vandenberghe, L., Balakrishnan, V., Walliny, R., Hanssony, A., Roh, T.: Interior-point algorithms for semidefinite programming problems derived from the KYP lemma. In: A. Garulli and D. Henrion, editors, Positive Polynomials in Control, Lecture Notes in Control and Information Sciences. Vol. 312, pp. 195–238. Springer, 2005Google Scholar
- 23.Zalgaller, V.A.:
*k*-dimensional directions singular for a convex body*F*in*R*^{n}. Zap. Naučn. Sem. Leningrad. Otdel. Mat. Inst. Steklov.,**27**, 67–72, 1972. English translation: J. Soviet Math. 3 (1975) 437–441MathSciNetGoogle Scholar