1. Limited time only! Sign up for a free 30min personal tutor trial with Chegg Tutors
    Dismiss Notice
Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

Saddle-point problem and strong duality

  1. Oct 4, 2012 #1
    Hello everyone,

    Assume we have a general minimax problem
    [itex] \min\limits_{x \in X}{\max\limits_{y \in Y}{(Ax,y) \,\,+G(x) - F^*(y)} },[/itex]
    where [itex]G, \,F^*\,[/itex] are proper, convex and lower-semicontinuous and [itex]F^*[/itex] is a conjugate of another function F.
    The corresponding primal problem is
    [itex]\min\limits_{x \in X}{F(Ax) + G(x)}[/itex]
    and the dual problem is
    [itex]\max\limits_{y \in Y}{-G^*(-A^*y) - F^*(y)}[/itex]
    My question is whether there is a criterion for strong duality (something analogous to Slater's conditions for constrained optimization).
    Thanks in advance.
  2. jcsd
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Can you offer guidance or do you also need help?
Draft saved Draft deleted

Similar Discussions: Saddle-point problem and strong duality
  1. Saddle point question. (Replies: 0)

  2. Point packing problem (Replies: 4)