Abstract
We propose a general alternating minimization algorithm for nonconvex optimization problems with separable structure and nonconvex coupling between blocks of variables. To fix our ideas, we apply the methodology to the problem of blind ptychographic imaging. Compared to other schemes in the literature, our approach differs in two ways: (i) it is posed within a clear mathematical framework with practical verifiable assumptions, and (ii) under the given assumptions, it is provably convergent to critical points. A numerical comparison of our proposed algorithm with the current state of the art on simulated and experimental data validates our approach and points toward directions for further improvement.
| Original language | English |
|---|---|
| Pages (from-to) | 426-457 |
| Number of pages | 32 |
| Journal | SIAM Journal on Imaging Sciences |
| Volume | 8 |
| Issue number | 1 |
| DOIs | |
| State | Published - 24 Feb 2015 |
| Externally published | Yes |
Keywords
- Alternating minimization
- Deconvolution
- Kurdyka-Łojasiewicz
- Nonconvex-nonsmooth minimization
- Ptychography
All Science Journal Classification (ASJC) codes
- General Mathematics
- Applied Mathematics