264 Bibliography
[64] Byrne, C. (2009) “Block-iterative algorithms.” International Transac-
tions in Operations Research, 16(4), pp. 427–463.
[65] Byrne, C. (2009) “Bounds on the largest singular value of a matrix
and the convergence of simultaneous and block-iterative algorithms
for sparse linear systems.” International Transactions in Op erations
Research, 16(4), pp. 465–479.
[66] Byrne, C. (2013) “Alternating minimization as sequential uncon-
strained minimization: a survey.” Journal of Optimization Theory and
Applications, electronic 154(3), DOI 10.1007/s1090134-2, 2012, and
hardcopy 156(3), February, 2013, pp. 554–566.
[67] Byrne, C. (2013) “An elementary proof of convergence of the forward-
backward splitting algorithm.” To appear in the Journal of Nonlinear
and Convex Analysis.
[68] Byrne, C., and Eggermont, P. (2011) “EM Algorithms.” In Handbook
of Mathematical Methods in Imaging, Otmar Scherzer, ed., pp. 271–
344. New York: Springer-Science.
[69] Byrne, C., Censor, Y., A. Gibali, A., and Reich, S. (2012) “The split
common null point problem.” Journal of Nonlinear and Convex Anal-
ysis, 13, pp. 759–775.
[70] Byrne, C., and Ward, S. (2005) “Estimating the largest singular value
of a sparse matrix.” Unpublished notes.
[71] Byrne, C., and Wells, D. (1983) “Limit of continuous and discrete
finite-band Gerchberg iterative spectrum extrapolation.”Optics Let-
ters, 8(10), pp. 526–527.
[72] Byrne, C., and Wells, D. (1985) “Optimality of certain iterative and
non-iterative data extrapolation procedures.”Journal of Mathematical
Analysis a nd Applications, 111(1), pp. 26–34.
[73] Cand`es, E., Romberg, J., and Tao, T. (2006) “Robust uncertainty prin-
ciples: exact signal reconstruction from highly incomplete frequency
information.” IEEE Transactions on Information Theory, 52(2), pp.
489–509.
[74] Cand`es, E., and Romberg, J. (2007) “Sparsity and incoherence in com-
pressive sampling.” Inverse Problems, 23(3), pp. 969–985.
[75] Cand`es, E., Wakin, M., and Boyd, S. (2007) “Enhancing sparsity by
reweighted l
1
minimization.” Preprint available at http://www.acm.
caltech.edu/
emmanuel/publications.html.

Get Iterative Optimization in Inverse Problems now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.