Convex programming on spaces of measurable functions (Q1060681)

From MaRDI portal
Revision as of 02:04, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Convex programming on spaces of measurable functions
scientific article

    Statements

    Convex programming on spaces of measurable functions (English)
    0 references
    0 references
    0 references
    0 references
    1985
    0 references
    In the last years many authors have tried to apply the results concerning optimization problems for convex functionals to the case when the functions take values in an ordered vector space. We know that the theory of conjugate functionals has important applications to duality in problems of optimization [see, f.e. \textit{I. Singer}, Lect. Notes Econ. Math. Syst. 226, 80-97 (1984; Zbl 0545.49008)]. In this work the authors consider the case of operators defined on the real line \({\mathbb{R}}\) with values in the space of measurable functions, obtaining some duality theorems. One of these is a generalization of the Fenchel-Moreau theorem and another one is a generalization of Fenchel's theorem. The authors intend to treat the general case in a later publication. Waiting for this we already consider the present work as a great progress in the theory of optimization problems.
    0 references
    0 references
    conjugate functionals
    0 references
    duality theorems
    0 references
    Fenchel-Moreau theorem
    0 references

    Identifiers

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