MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

It is obvious that there is similarity between subgradient and gradient. The subgradient of smooth functions is reduced to gradient. I have two questions.

The first is does there exist subgradient decent method (analogous to the well known gradient decent mothod) in nonsmooth problems.

The second is, given a nonsmooth function, how to determine the subgradient? (by computer)

Summarily, I have no idea of the role of subgradient in programming of nonsmooth functions. Is it just a concept or a very useful tool (like gradient)?

share|cite|improve this question
1  
There is an obvious Google search here ("subgradient descent")... – Qiaochu Yuan Apr 2 '13 at 6:38
1  
this is not a research level MO question; please have a look at any of the textbooks on nonsmooth stuff; for convex optimization: "introductory lectures on convex optimization" by Yu. Nesterov; for nonconvex, nonsmooth functions, subdifferential calculus is much more tricky, but a practical starting point it "Nonsmooth analysis" by F. Clarke; also, have a look at online slides of S. Boyd's 364b course at stanford... – Suvrit Apr 2 '13 at 6:50

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.