Optimization with set relations: conjugate duality
Author:
- Andreas LöhneALAndreas Löhne
- 1 June 2005
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 54 (3) , 265-282
Abstract
The aim of this article is to develop a conjugate duality theory, based on set relation approach, for convex set-valued maps. The basic idea is to understand a convex set-valued map as a function with values in the space of closed convex subsets of . The usual inclusion of sets provides a natural ordering relation in this space. Infimum and supremum with respect to this ordering relation can be expressed with the aid of union and intersection. Our main result is a strong duality assertion formulated along the lines of classical duality theorems for extended real-valued convex functions.Keywords
This publication has 11 references indexed in Scilit:
- Convex Analysis and Nonlinear Optimization2000
- Introduction to Operator Theory in Riesz Spaces1997
- Power structuresAlgebra universalis, 1993
- Convex Analysis and Minimization Algorithms I1993
- Conjugate duality in vector optimizationJournal of Mathematical Analysis and Applications, 1992
- Ordered Cones and Approximation1992
- Existence and Lagrangian duality for maximizations of set-valued functionsJournal of Optimization Theory and Applications, 1987
- Konvexe Analysis1977
- Convex Analysis1970
- An Embedding Theorem for Spaces of Convex SetsProceedings of the American Mathematical Society, 1952