Non-Smooth Programs

  • Sanjo Zlobec
Part of the Applied Optimization book series (APOP, volume 57)

Abstract

Optimality of a feasible point in the convex program (CP) can be checked using a saddle-point condition regardless of whether the functions are differentiable (“smooth”) or not. An alternative approach is to use the objects called “subgradients” and “subdifferentials”:

Keywords

Hull Butane 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 2001

Authors and Affiliations

  • Sanjo Zlobec
    • 1
  1. 1.McGill UniversityMontréalCanada

Personalised recommendations