3
$\begingroup$

For convex smooth optimization, first and second order necessary and sufficient conditions are well known. Does such standard second order necessary and sufficient conditions exist for convex nonsmooth optimization. For first order, we have the well known condition that zero must belong to the subgradient set of the function. In that sense what is a second order analogue of Hessian being positive semidefinite in convex nonsmooth settings. What will differ in constrained and unconstrained settings?

Note: I had asked the same question on Mathematics Stack Exchange but did not get any answer. I felt like MathOverflow is a better place to ask this question as it probably involves advanced research.

Improve this question
$\endgroup$

1 Answer 1

Reset to default
1
$\begingroup$

For convex optimization problems, you do not need second-order conditions, because already the optimality conditions of first order characterize global optimality.

Improve this answer
$\endgroup$
1
  • $\begingroup$ Thank You. My intention here is not to just find optima. Since in convex smooth settings we indeed study the second order conditions to understand the nature of optima whether its unique or not. I wanted to know if something analogous existed in non smooth settings. $\endgroup$
    – Engineer_2018
    Commented Apr 25, 2019 at 13:56

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .