Lecture 18 Subgradients
Lecture 18 Subgradients
Lecture 18 Subgradients
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
• ∂f(ˆx) Bounded.<br />
By the subgradient inequality, we have<br />
<strong>Lecture</strong> <strong>18</strong><br />
f(x) ≥ f(ˆx) + s T (x − ˆx) for all x ∈ dom f<br />
Suppose that the subdifferential ∂f(ˆx) is unbounded. Let s k be a<br />
sequence of subgradients in ∂f(ˆx) with ‖s k ‖ → ∞.<br />
Since ˆx lies in the interior of domain, there exists a δ > 0 such that<br />
ˆx + δy ∈ dom f for any y ∈ R n . Letting x = ˆx + δ s k<br />
for any k, we<br />
‖s k ‖<br />
have<br />
(<br />
f ˆx + δ<br />
s )<br />
k<br />
≥ f(ˆx) + δ‖s k ‖ for all k<br />
‖s k ‖<br />
As k → ∞, we have f (ˆx + δ s )<br />
k<br />
‖s k ‖ − f(ˆx) → ∞.<br />
However, this relation contradicts the continuity of f at ˆx. [Recall, a<br />
convex function is continuous over the interior of its domain.]<br />
Example Consider f(x) = − √ x with dom f = {x | x ≥ 0}. We have<br />
∂f(0) = ∅. Note that 0 is not in the interior of the domain of f<br />
Convex Optimization 7