Adjoint Process Duality (Q3317644)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3848099
Language Label Description Also known as
default for all languages
No label defined
    English
    Adjoint Process Duality
    scientific article; zbMATH DE number 3848099

      Statements

      Adjoint Process Duality (English)
      0 references
      1983
      0 references
      closed graph theorem
      0 references
      open mapping theorem
      0 references
      convex process
      0 references
      adjoint process
      0 references
      Duality theorems
      0 references
      Let F:\(X\to Y\) be a multivalued mapping between the locally convex spaces X and Y. F is said to be a convex process if its graph \(Gr(F):=\{(x,y)\in X\times Y:y\in F(x)\}\) is a convex cone in \(X\times Y\). The adjoint process is defined as a set-valued mapping \(F^*:Y'\to X'\) between the conjugate spaces X' and Y' such that \(x'\in F^*(y')\) iff \(<y,y'>\geq<x,x'>\) whenever \(y\in F(x)\). Convex processes and adjoint processes were introduced by \textit{R. T. Rockafellar} [Mem. Amer. Math. Soc. 77 (1967; Zbl 0189.196); Convex analysis, Princeton University Press (1970; Zbl 0193.184)]. The paper contains a comprehensive study of convex processes and their adjoints. Convolution, sum, composition and product of two (or more) processes are defined and formulae for computation of these and their adjoints are given. An analog of the closed graph-open mapping theorem as well as different criteria for a convex process or relation to possess closure properties are presented. Duality theorems are proved which generalize the classical duality between range space and null space for linear mappings, Farkas lemma, Fenchel duality, geometric duality etc. The results are applied to generalized linear programs. Many particular cases (semi-infinite programming, homogeneous convex programming, least element linear programming, continuous linear programming) are analysed from the point of view of convex processes.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references
      0 references