M. W. Carter, H. H. Jin, M. A. Saunders, and Y. Ye.
SpaseLoc: An adaptive subproblem algorithm for
scalable wireless sensor network localization,
SIAM J. on Optimization 17(4), 1102-1128 (2006).
(pdf)
R. Tibshirani, M. A. Saunders, S. Rosset, J. Zhu, and K. Knight.
Sparsity and smoothness via the fused lasso,
J. Royal Statistical Society B 67(1), 91-108 (2005).
(pdf)
M. P. Friedlander and M. A. Saunders.
A globally convergent linearly constrained Lagrangian method for nonlinear optimization,
SIAM J. on Optimization 15(3), 863-897 (2005).
(pdf)
P. E. Gill, W. Murray and M. A. Saunders.
SNOPT: An SQP algorithm for large-scale constrained optimization,
SIAM Review 47(1), 99-131 (2005).
(pdf)
M. Jacobsen, P. C. Hansen and M. A. Saunders.
Subspace preconditioned LSQR for discrete ill-posed problems,
BIT 43, 975-989 (2003).
(pdf)
S. S. Chen, D. L. Donoho, and M. A. Saunders.
Atomic decomposition by Basis Pursuit,
SIAM Review 43(1), 129-159 (2001).
(pdf)
G. Infanger.
Monte Carlo (importance) sampling within a Benders
decomposition algorithm for stochastic linear programs,
Annals of Operations Research 39 (1992) 69-95.
(pdf)
P. E. Gill, W. Murray, M. A. Saunders and M. H. Wright.
Sparse matrix methods in optimization,
SIAM J. on Scientific and Statistical Computing 5(3), 562-589 (1984).
(pdf)
P. E. Gill, G. H. Golub, W. Murray, and M. A. Saunders.
Methods for modifying matrix factorizations,
Mathematics of Computation 28(126), 505-535 (1974).
(pdf)
