personnel profile
Michael A. Saunders
|
|
|
Research Statement
Saunders develops mathematical methods for solving large-scale constrained optimization problems and large systems of equations. He also implements such methods as general-purpose software to allow their use in many areas of engineering, science, and business. He is co-developer of the large-scale optimizers MINOS, SNOPT, SQOPT and the linear equation solvers SYMMLQ, MINRES, LSQR, LUSOL.
Stanford lab and program affiliations
For a list of Saunders's publications, see his
publications page.
| Degree |
Discipline |
Year |
School |
| PhD |
Computer Science |
1972 |
Stanford University |
| MS |
Computer Science |
1970 |
Stanford University |
| B.Sc. (Hons) |
Mathematics |
1965 |
Cantebury |
| Publication Title | Author(s)/Speaker(s) | Open Document |
|
A globally convergent linearly constrained Lagrangian method
for nonlinear optimization
|
M. P. Friedlander; M. A. Saunders |
|
|
SNOPT: An SQP algorithm for large-scale constrained optimization
|
P. E. Gill; W. Murray; M. A. Saunders |
|
|
Atomic decomposition by basis pursuit
|
S. S. Chen; D. L. Donoho; M. A. Saunders |
|
Title:
A globally convergent linearly constrained Lagrangian method
for nonlinear optimization
Author(s):
M. P. Friedlander; M. A. Saunders
Journal:
SIAM Journal on Optimization
, Volume 15
, Number 3
Date Published:
2005
Details:
Best paper award, ICCOPT 1, RPI, NY
Title:
SNOPT: An SQP algorithm for large-scale constrained optimization
Author(s):
P. E. Gill; W. Murray; M. A. Saunders
Journal:
SIAM Review
, Volume 47
, Number 1
Date Published:
2005
Details:
Selected as SIGEST article
Title:
Atomic decomposition by basis pursuit
Author(s):
S. S. Chen; D. L. Donoho; M. A. Saunders
Journal:
SIAM Review
, Volume 43
, Number 1
Date Published:
2001
Details:
Selected as SIGEST article
|
|
Display All Publications
|
Academic Honors & Awards
- Orchard-Hays Prize, MPS, 1985
- Hon FRSNZ, 2007