Duality Results for Conic Convex Programming 1

  title={Duality Results for Conic Convex Programming 1},
  author={Jos F. Sturm and Shuzhong Zhang},
This paper presents a uni ed study of duality properties for the problem of minimizing a linear function over the intersection of an a ne space with a convex cone in nite dimension. Existing duality results are carefully surveyed and some new duality properties are established. Examples are given to illustrate these new properties. The topics covered in this paper include Gordon-Stiemke type theorems, Farkas type theorems, perfect duality, Slater condition, regularization, Ramana's duality, and… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 45 references

Convex Analysis

  • R. T. Rockafellar
  • Princeton University Press, Princeton, NJ,
  • 1970
Highly Influential
9 Excerpts

Linear Inequalities and Related Systems, pages 157{170

  • R. J. Du n
  • 1956
Highly Influential
10 Excerpts

 Uber die Theorie des einfachen Ungleichungen

  • J. Farkas
  • Journal f ur die reine und angewandte…
  • 1902
Highly Influential
10 Excerpts

Strong duality for semide nite programming

  • M. V. Ramana, L. Tun cel, H. Wolkowicz
  • Technical Report 85-12,
  • 1995
Highly Influential
10 Excerpts

Characterizations of optimality for the abstract convex program with nite dimensional range

  • J. M. Borwein, H. Wolkowicz
  • Journal of the Australian Mathematical Society…
  • 1981
Highly Influential
7 Excerpts

Similar Papers

Loading similar papers…