Abstract

Geometric duality theory for multiple objective linear programming problems turned out to be very useful for the development of efficient algorithms to generate or approximate the whole set of nondominated points in the outcome space. This article extends the geometric duality theory to convex vector optimization problems.

Author information

Contact details are reproduced from the original publication and may be historical.

Keywords

  • Geometric duality theory
  • vector optimization
  • Legendre-Fenchel conjugate
  • second-order subdifferential
  • Dupin indicatrix

Mathematics Subject Classification

52A41, 52A20, 90C46, 90C29

References

  1. H. Busemann: Convex Surfaces, Interscience Tracts in Pure and Applied Mathematics 6, Interscience, New York (1958).Google Scholar
  2. J. P. Crouzeix: A relationship between the second derivatives of a convex function and of its conjugate, Math. Program. 13(3) (1977) 364–365.https://doi.org/10.1007/BF01584350Google Scholar
  3. M. Ehrgott, A. Löhne, L. Shao: A dual variant of Benson’s “outer approximation algorithm” for multiple objective programming, J. Glob. Optim. 52(4) (2012) 757–778.https://doi.org/10.1007/s10898-011-9709-yGoogle Scholar
  4. A. H. Hamel: Translative sets and functions and their applications to risk measure theory and nonlinear separation, IMPA preprint D021 (2006).Google Scholar
  5. F. Heyde, A. Löhne: Geometric duality in multiple objective linear programming, SIAM J. Optim. 19(2) (2008) 836–845.https://doi.org/10.1137/060674831Google Scholar
  6. J.-B. Hiriart-Urruty, A. Seeger: The second-order subdifferential and the Dupin indicatrices of a nondifferentiable convex function, Proc. Lond. Math. Soc., III. Ser. 58(2) (1989) 351–365.https://doi.org/10.1112/plms/s3-58.2.351Google Scholar
  7. A. Löhne: Vector Optimization with Infimum and Supremum, Springer, Berlin (2011).https://doi.org/10.1007/978-3-642-18351-5Google Scholar
  8. A. Löhne, B. Rudloff: An algorithm for calculating the set of superhedging portfolios and strategies in markets with transaction costs, arXiv:1107.5720 [q-fin.PR] (2011), to appear.Google Scholar
  9. R. T. Rockafellar: Convex Analysis, Princeton Mathematical Series 28, Princeton University Press, Princeton (1970).Google Scholar
  10. R. T. Rockafellar: First- and second-order epi-differentiability in nonlinear programming, Trans. Amer. Math. Soc. 307(1) (1988) 75–108.https://doi.org/10.1090/S0002-9947-1988-0936806-9Google Scholar
  11. R. T. Rockafellar: Generalized second derivatives of convex functions and saddle functions, Trans. Amer. Math. Soc. 322(1) (1990) 51–77.https://doi.org/10.1090/S0002-9947-1990-1031242-0Google Scholar
  12. R. T. Rockafellar, R. J.-B. Wets: Variational Analysis, Grundlehren der Mathematischen Wissenschaften 317, Springer, Berlin (1998).https://doi.org/10.1007/978-3-642-02431-3Google Scholar
  13. A. Seeger: Second derivatives of a convex function and of its Legendre-Fenchel transformate, SIAM J. Optim. 2(3) (1992) 405–424.https://doi.org/10.1137/0802020Google Scholar
  14. A. Seeger: Second-order normal vectors to a convex epigraph, Bull. Aust. Math. Soc. 50(1) (1994) 123–134.https://doi.org/10.1017/S0004972700009631Google Scholar
  15. R. Webster: Convexity, Oxford Science Publications, Oxford University Press, Oxford (1994).Google Scholar
  16. C. Zălinescu: Convex Analysis in General Vector Spaces, World Scientific, River Edge (2002).https://doi.org/10.1142/5021Google Scholar

Suggested citation

F. Heyde. “Geometric Duality for Convex Vector Optimization Problems.” Journal of Convex Analysis 20 (2013), No. 3, 813–832. https://doi.org/10.68381/jca20044

Download BibTeXPublished by Heldermann Verlag.

Published by Heldermann Verlag, 2013. Rights now held by Banach Press LLC.