2013 - SIAM Fellow For contributions to numerical optimization, linear algebra, and software.
His primary areas of investigation include Mathematical optimization, Nonlinear programming, Algorithm, Constrained optimization and Linear programming. His research investigates the link between Mathematical optimization and topics such as Sequence that cross with problems in Term, Quadratic penalty function and Type. He interconnects Subroutine, Fortran, Augmented Lagrangian method and Sequential quadratic programming in the investigation of issues within Nonlinear programming.
His work on Sparse approximation and Total variation denoising as part of general Algorithm study is frequently connected to Basis pursuit denoising and Basis pursuit, therefore bridging the gap between diverse disciplines of science and establishing a new relationship between them. His biological study spans a wide range of topics, including Quasi-Newton method and Hessian matrix. His studies in Optimization problem integrate themes in fields like Factorization, Orthogonal basis, Wavelet packet decomposition and Cholesky decomposition.
His primary areas of study are Mathematical optimization, Nonlinear programming, Algorithm, Quadratic programming and Applied mathematics. His study on Mathematical optimization is mostly dedicated to connecting different topics, such as Nonlinear system. His Nonlinear programming research focuses on subjects like Optimization problem, which are linked to Robustness and Sequence.
A large part of his Algorithm studies is devoted to Sparse approximation. His study in the fields of Quadratically constrained quadratic program under the domain of Quadratic programming overlaps with other disciplines such as Second-order cone programming. The Applied mathematics study combines topics in areas such as Function, Iterative method, Condition number and Mathematical analysis.
Michael A. Saunders mostly deals with Mathematical optimization, Algorithm, Nonlinear system, Optimization problem and Applied mathematics. His work is dedicated to discovering how Mathematical optimization, Nonlinear programming are connected with Penalty method and other disciplines. His Algorithm research includes themes of Spectral line, Solver and Constrained optimization.
His work in Nonlinear system addresses issues such as Simplex, which are connected to fields such as Exponential growth. His Optimization problem research includes elements of Sequence, Scale, Augmented Lagrangian method and Biochemical engineering. His work deals with themes such as Iterative method, Black box, Canonical correlation and Minification, which intersect with Applied mathematics.
His scientific interests lie mostly in Systems biology, Mathematical optimization, Antibody, Immune system and Cytokine. As a part of the same scientific family, Michael A. Saunders mostly works in the field of Systems biology, focusing on Metabolism and, on occasion, Macromolecule and Biological system. The various areas that Michael A. Saunders examines in his Mathematical optimization study include Algorithm, MATLAB, Subroutine and Nonlinear system.
His study in Algorithm is interdisciplinary in nature, drawing from both Expression, Nonlinear programming and Solver. His work in the fields of Antibody, such as Immunoglobulin E, overlaps with other areas such as Mepolizumab and Interleukin 5. His Linear programming research incorporates elements of Quadratic equation, Quadratic function, Quadratic programming, Constrained optimization and Fortran.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Atomic Decomposition by Basis Pursuit
Scott Shaobing Chen;David L. Donoho;Michael A. Saunders.
Siam Review (2001)
Atomic Decomposition by Basis Pursuit
Scott Shaobing Chen;David L. Donoho;Michael A. Saunders.
Siam Review (2001)
Atomic Decomposition by Basis Pursuit
Scott Shaobing Chen;David L. Donoho;Michael A. Saunders.
SIAM Journal on Scientific Computing (1998)
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
Christopher C. Paige;Michael A. Saunders.
ACM Transactions on Mathematical Software (1982)
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
Christopher C. Paige;Michael A. Saunders.
ACM Transactions on Mathematical Software (1982)
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Philip E. Gill;Walter Murray;Michael A. Saunders.
Siam Review (2005)
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
Philip E. Gill;Walter Murray;Michael A. Saunders.
Siam Review (2005)
Sparsity and smoothness via the fused lasso
Robert Tibshirani;Michael D Saunders;Saharon Rosset;Ji Zhu.
Journal of The Royal Statistical Society Series B-statistical Methodology (2005)
Solution of Sparse Indefinite Systems of Linear Equations
C. C. Paige;M. A. Saunders.
SIAM Journal on Numerical Analysis (1975)
Solution of Sparse Indefinite Systems of Linear Equations
C. C. Paige;M. A. Saunders.
SIAM Journal on Numerical Analysis (1975)
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:
University of California, San Diego
Stanford University
New York University
University of California, San Diego
National University of Ireland, Galway
McGill University
Princeton University
Stanford University
University of California, Berkeley
Stanford University
Columbia University
University of Messina
Tokyo Institute of Technology
University of Lille
Oregon Health & Science University
Max Planck Society
University of Michigan–Ann Arbor
Geoscience Australia
University of California, Santa Cruz
University of East Anglia
Oak Ridge National Laboratory
Washington University in St. Louis
University of Nevada, Las Vegas
University of Wisconsin–Madison
Tufts University
Beth Israel Deaconess Medical Center