IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-642-04900-2_4.html
   My bibliography  Save this book chapter

Biconjugate Functions

In: Conjugate Duality in Convex Optimization

Author

Listed:
  • Radu Ioan Boţ

    (Chemnitz University of Technology)

Abstract

As follows from the Fenchel–Moreau Theorem, when the dual of a normed space X is endowed with the weak∗ topology, the biconjugate of a proper, convex and lower semicontinuous function defined on X coincides with the function itself. This is not necessarily the case when X ∗ is endowed with the strong topology. Working in the latter setting, we give in this chapter formulae for the biconjugates for some classes of functions, which appear in the convex optimization, that hold provided the validity of some suitable regularity conditions. Consider X a normed space with the norm $$\|\cdot\|$$ and X ∗ its topological dual space, the norm of which being denoted by $$\|\cdot\|_{\ast}$$ . On this space we work with three topologies, namely the strong one induced by $$\|\cdot\|_{\ast}$$ which attaches X ∗∗ as dual to X ∗, the weak∗ one induced by X on X ∗, ω(X ∗, X), which makes X to be the dual of X ∗ and the weak one induced by X ∗∗ on X ∗, ω(X ∗, X ∗∗), that is the weakest topology on X ∗ which attaches X ∗∗ as dual to X ∗∗. We specify each time when a weak topology is used, otherwise the strong one is considered. Like in the previous section, for sets and functions the closures and the lower semicontinuous hulls, respectively, in the weak∗ topologies are denoted by clω*, while the ones in the weak topologies are denoted by clω. A normed space X can be identified with a subspace of X ∗∗, and we denote by $$\widehat{x}$$ the canonical image in X ∗∗ of the element $$x \in X,\ {\rm i.e.}\ \langle\widehat{x}, x^{\ast}\rangle = \langle x^{\ast}, x\rangle\ {\rm for\ all}\ x \in X\ {\rm and}\ x^{\ast} \in X^{\ast}$$ , where by $$\langle\cdot,\cdot\rangle$$ we denote the duality product in both $$X^{\ast} \times X\ {\rm and}\ X^{\ast\ast} \times X^{\ast}.\ {\rm For}\ U \subseteq X\ {\rm denote\ also}\ \widehat{U} = \{\widehat{x} : x \in U\}$$ . In this setting, when $$f : X \rightarrow \overline{\mathbb{R}}$$ is a given function, its biconjugate $$f^{\ast\ast} : X^{\ast\ast} \rightarrow \overline{\mathbb{R}}$$ is defined by $$f^{\ast\ast} (x^{\ast\ast}) = {\rm sup}\{\langle x^{\ast\ast}, x^{\ast}\rangle - f^{\ast}(x^{\ast}) : x^{\ast} \in X^{\ast}\}$$ . For the beginning we prove the following preliminary result.

Suggested Citation

  • Radu Ioan Boţ, 2010. "Biconjugate Functions," Lecture Notes in Economics and Mathematical Systems, in: Conjugate Duality in Convex Optimization, chapter 0, pages 65-86, Springer.
  • Handle: RePEc:spr:lnechp:978-3-642-04900-2_4
    DOI: 10.1007/978-3-642-04900-2_4
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:lnechp:978-3-642-04900-2_4. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.