• Title of article

    Necessary and sufficient conditions for stable conjugate duality Original Research Article

  • Author/Authors

    R.S. Burachik، نويسنده , , V. Jeyakumar، نويسنده , , Z.-Y. Wu، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2006
  • Pages
    9
  • From page
    1998
  • To page
    2006
  • Abstract
    The conjugate duality, which states that infx∈Xφ(x,0)=maxv∈Y′-φ*(0,v)infx∈Xφ(x,0)=maxv∈Y′-φ*(0,v), whenever a regularity condition on φφ is satisfied, is a key result in convex analysis and optimization, where φ:X×Y→R∪{+∞}φ:X×Y→R∪{+∞} is a convex function, X and Y are Banach spaces, Y′Y′ is the continuous dual space of Y and φ*φ* is the Fenchel–Moreau conjugate of φφ. In this paper, we establish a necessary and sufficient condition for the stable conjugate duality, View the MathML sourceinfx∈X{φ(x,0)+x*(x)}=maxv∈Y′{-φ*(-x*,v)},∀x*∈X′ Turn MathJax on and then obtain a new epigraph regularity condition for the conjugate duality. The regularity condition is shown to be much more general than the popularly known interior-point type conditions. As an easy consequence we present an epigraph closure condition which is necessary and sufficient for a stable Fenchel–Rockafellar duality theorem. In the case where one of the functions involved is a polyhedral convex function, we provide generalized interior-point conditions for the epigraph regularity condition. Moreover, we show that a stable Fenchelʹs duality for sublinear functions holds whenever a subdifferential sum formula for the functions holds.
  • Keywords
    Polyhedral functions , Convex programming , Constraint qualifications , Conjugate duality , Sublinear functions
  • Journal title
    Nonlinear Analysis Theory, Methods & Applications
  • Serial Year
    2006
  • Journal title
    Nonlinear Analysis Theory, Methods & Applications
  • Record number

    859303