Follow
Michael Saunders
Michael Saunders
Professor of Operations Research, Stanford University
Verified email at stanford.edu - Homepage
Title
Cited by
Cited by
Year
Atomic decomposition by basis pursuit
SS Chen, DL Donoho, MA Saunders
SIAM review 43 (1), 129-159, 2001
139332001
LSQR: An algorithm for sparse linear equations and sparse least squares
CC Paige, MA Saunders
ACM Transactions on Mathematical Software (TOMS) 8 (1), 43-71, 1982
52531982
SNOPT: An SQP algorithm for large-scale constrained optimization
PE Gill, W Murray, MA Saunders
SIAM review 47 (1), 99-131, 2005
47722005
Sparsity and smoothness via the fused lasso
R Tibshirani, M Saunders, S Rosset, J Zhu, K Knight
Journal of the Royal Statistical Society: Series B (Statistical Methodology …, 2005
30532005
Solution of sparse indefinite systems of linear equations
CC Paige, MA Saunders
SIAM journal on numerical analysis 12 (4), 617-629, 1975
23881975
MINOS 5.0 User's Guide.
BA Murtagh, MA Saunders
Stanford Univ CA Systems Optimization Lab, 1983
21141983
Algorithm 583: LSQR: Sparse linear equations and least squares problems
CC Paige, MA Saunders
ACM Transactions on Mathematical Software (TOMS) 8 (2), 195-209, 1982
9501982
Methods for modifying matrix factorizations
PE Gill, GH Golub, W Murray, MA Saunders
Mathematics of computation 28 (126), 505-535, 1974
8371974
Large-scale linearly constrained optimization
BA Murtagh, MA Saunders
Mathematical programming 14 (1), 41-72, 1978
7561978
Creation and analysis of biochemical constraint-based models using the COBRA Toolbox v. 3.0
L Heirendt, S Arreckx, T Pfau, SN Mendoza, A Richelle, A Heinken, ...
Nature protocols 14 (3), 639-702, 2019
7502019
Towards a generalized singular value decomposition
CC Paige, MA Saunders
SIAM Journal on Numerical Analysis 18 (3), 398-405, 1981
7451981
On projected Newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
PE Gill, W Murray, MA Saunders, JA Tomlin, MH Wright
Mathematical programming 36 (2), 183-209, 1986
6651986
User's guide for NPSOL (version 4.0): A Fortran package for nonlinear programming.
PE Gill, W Murray, MA Saunders, MH Wright
Stanford Univ CA Systems Optimization Lab, 1986
5821986
LSMR: An iterative algorithm for sparse least-squares problems
DCL Fong, M Saunders
SIAM Journal on Scientific Computing 33 (5), 2950-2971, 2011
4662011
A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
BA Murtagh, MA Saunders
Algorithms for constrained minimization of smooth nonlinear functions, 84-117, 1982
4311982
User’s guide for SNOPT version 7: Software for large-scale nonlinear programming
PE Gill, W Murray, MA Saunders
Numerical Analysis Report 2, 2006
4012006
Aquifer reclamation design: the use of contaminant transport simulation combined with nonlinear programing
SM Gorelick, CI Voss, PE Gill, W Murray, MA Saunders, MH Wright
Water Resources Research 20 (4), 415-427, 1984
3751984
User’s guide for NPSOL 5.0: A Fortran package for nonlinear programming
PE Gill, W Murray, MA Saunders, MH Wright
Technical Report NA 98-2, Department of Mathematics, University of …, 1998
3721998
Procedures for optimization problems with a mixture of bounds and general linear constraints
PE Gill, W Murray, MA Saunders, MH Wright
ACM Transactions on Mathematical Software (TOMS) 10 (3), 282-298, 1984
3571984
User's guide for SNOPT 5.3: A Fortran package for large-scale nonlinear programming
PE Gill
Internal Report, Systems Optimization Laboratory, Standford University, USA, 1998
3161998
The system can't perform the operation now. Try again later.
Articles 1–20