Characterizations of optimality in convex programming: the nondifferentiable case

Authors:
  • ABA. Ben-Tal
    A. Ben-Tal
  • ABA. Ben-Israel
    A. Ben-Israel
  • MNM.Z. Nashed
    M.Z. Nashed

Abstract
Primal, dual and saddle-point characterizations of optimality are given for convex programming in the general case (nondifferentiable functions and no constraint qualification).