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

Strong and Total Conjugate Duality

In: Conjugate Duality in Convex Optimization

Author

Listed:
  • Radu Ioan Boţ

    (Chemnitz University of Technology)

Abstract

In this chapter, we are interested in formulating regularity conditions of closednesstype, which do not necessarily guarantee stable strong duality, but are sufficient for having strong duality. First, we do this for the primal–dual pair (PG)–(DG) and after that we particularize the general result to the different classes of problems investigated in the previous chapters. Assume that X and Y are separated locally convex spaces, with X ∗ and Y ∗ their topological dual spaces, respectively, and $$\Phi : X \times Y \rightarrow \overline{\mathbb{R}}$$ is a proper and convex function such that $$0 \in {\rm Pr}Y ({\rm dom} \Phi)$$ . Throughout this chapter we assume that the dual spaces are endowed with the weak∗ topologies. As proved by Theorem 5.1, if Φ is lower semicontinuous, then for all $$x^{\ast} \in X^{\ast}$$ one has $$(\Phi(\cdot,0))^{\ast}(x^{\ast}) = {\rm cl}_{\omega\ast}\ ({\rm inf}_{y\ast\in Y\ast}\Phi^{\ast}(\cdot, y^{\ast}))(x^{\ast})$$ . Starting from this fact, one can formulate the following regularity condition for (PG) and its conjugate dual (DG $$(Rc_{5}^{\Phi} \left|\begin{array}{rcl}&&\Phi\ {\rm is\ lower\ semicontinuous\ and\ inf}_{y^{\ast} \in Y^{\ast}} \Phi^{\ast}(\cdot,y^{\ast})\ {\rm is\ lower}\\ &&{\rm semicontinuous\ and\ exact\ at\ 0}.\end{array}\right.$$ We say that $${\inf}_{y^{\ast}\in Y^{\ast}} \Phi^{\ast} (\cdot, y^{\ast})$$ is exact at $$\overline{x}^{\ast} \in X^{\ast}$$ if there exists $$\overline{y}^{\ast} \in Y^{\ast}$$ such that $${\rm inf}_{y^{\ast} \in Y^{\ast}} \Phi^{\ast}(\overline{x}^{\ast}, y^{\ast}) = \Phi^{\ast}(\overline{x}^{\ast}, \overline{y}^{\ast})$$ . We have the following general result.

Suggested Citation

  • Radu Ioan Boţ, 2010. "Strong and Total Conjugate Duality," Lecture Notes in Economics and Mathematical Systems, in: Conjugate Duality in Convex Optimization, chapter 0, pages 87-103, Springer.
  • Handle: RePEc:spr:lnechp:978-3-642-04900-2_5
    DOI: 10.1007/978-3-642-04900-2_5
    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_5. 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.