In this talk, we show that for a large class of optimization problems, the Lagrange multiplier rule can be derived from the so-called approximate multiplier rule and we prescribed an approximate gradient multiplier rule in handling non-smooth problems. Also in this talk we will cover some of available tools in handling non-smooth optimization.
