10.03.2015 Views

v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization

v2009.01.01 - Convex Optimization

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

298 CHAPTER 4. SEMIDEFINITE PROGRAMMING<br />

(143) (467) on page 295. From the numerical data given, cardinality ‖x‖ 0 = 1<br />

is expected. Iteration continues until x T y vanishes (to within some numerical<br />

precision); id est, until desired cardinality is achieved. But this comes not<br />

without a stall.<br />

Stalling, whose occurrence is sensitive to initial conditions of convex<br />

iteration, is a consequence of finding a local minimum of a multimodal<br />

objective 〈x, y〉 when regarded as simultaneously variable in x and y . Stalls<br />

are simply detected as solutions x of undesirable cardinality, sometimes<br />

remedied by reinitializing direction vector y to a random positive state.<br />

Bolstered by success in breaking out of a stall, we then apply convex<br />

iteration to 22,000 randomized problems:<br />

Given random data for m=3, n=6, k=1, in Matlab notation<br />

A=randn(3,6), index=round(5∗rand(1)) +1, b=rand(1)∗A(:,index)<br />

(685)<br />

the sparsest solution x∝e index is a scaled standard basis vector.<br />

Without convex iteration or a nonnegativity constraint x≽0, rate of failure<br />

for this minimum cardinality problem Ax=b by 1-norm minimization of x<br />

is 22%. That failure rate drops to 6% with a nonnegativity constraint. If<br />

we then engage convex iteration, detect stalls, and randomly reinitialize the<br />

direction vector, failure rate drops to 0% but the amount of computation is<br />

approximately doubled.<br />

<br />

Stalling is not an inevitable behavior. For some problem types (beyond<br />

mere Ax = b), convex iteration succeeds nearly all the time. Here is a<br />

cardinality problem, with noise, whose statement is just a bit more intricate<br />

but easy to solve in a few convex iterations:<br />

4.5.1.2.2 Example. Signal dropout. [102,6.2]<br />

Signal dropout is an old problem; well studied from both an industrial and<br />

academic perspective. Essentially dropout means momentary loss or gap in<br />

a signal, while passing through some channel, caused by some man-made<br />

or natural phenomenon. The signal lost is assumed completely destroyed<br />

somehow. What remains within the time-gap is system or idle channel noise.<br />

The signal could be voice over Internet protocol (VoIP), for example, audio<br />

data from a compact disc (CD) or video data from a digital video disc (DVD),

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!