### Transcription

Michael A. SaundersCurriculum Vitae, December 11, 2021Personal DataHome:Work:Office:Internet:Birth:2671 Ross Rd, Palo Alto, CA 94303Mobile 650-464-3971Dept of Management Science and EngineeringStanford University, Stanford, CA 94305-4121Suite 060, Room M03, ICME, Huang Engineering Center, anford.edu/ saundersJanuary 6, 1944, Christchurch, New ZealandEducation196519701972BSc (Hons), Mathematics, University of Canterbury, New ZealandMS, Computer Science, Stanford UniversityPhD, Computer Science, Stanford –Scientific Officer, Applied Mathematics Division, Dept of Scientific and IndustrialResearch (DSIR), Wellington, New ZealandResearch Assistant and Teaching Assistant, Computer Science Dept, Stanford University; Graduate Study Leave (part salary) from DSIRScientific Officer, Applied Mathematics Division, DSIR, Wellington, New ZealandResearch Associate, Systems Optimization Laboratory, Dept of Operations Research,Stanford UniversityScientist, Applied Mathematics Division, DSIR, Wellington, New ZealandSenior Research Associate, Systems Optimization Laboratory, Dept of Operations Research, Stanford UniversityProfessor (Research), Systems Optimization Laboratory, Depts of OR, EESOR, andManagement Science and Engineering, Stanford UniversityProfessor (Research) Emeritus, recalled to active duty, ICME and Management Science& Engineering, Stanford UniversityProfessor (Research) Emeritus, ICME and Management Science & Engineering, Stanford UniversityOther t) Visiting Research Fellow, Division of Numerical Analysis and Computing, National Physical Laboratory, Teddington, England(May–Jun) Visiting Scholar, Dept of Mathematics, University of Linköping, Linköping,Sweden(Jul–Aug) Visiting Fellow, Dept of Operations Research, University of Canterbury,Christchurch, New ZealandVisiting Scholar, IBM Almaden Research Center (2 days/week)(Jul–Oct) Visiting Professor, Dept of Engineering Science, University of Auckland,New Zealand (taught Master’s class on Nonlinear Optimization)(Aug) Visiting Professor, Institute of Mathematical Modelling (IMM), Technical University of Denmark, Lyngby, Denmark(Jul) Visiting Professor, Dept of Mathematics and Physics, Mälardalen University,Västerås, Sweden(Aug) Visiting Professor, IMM, Technical University of DenmarkHonors1962–641965New Zealand University National ScholarshipNew Zealand University Senior Scholarship

Michael A. Saunders1968–711967, 1220132New Zealand University Postgraduate ScholarshipUS Fulbright Travel GrantWilliam Orchard-Hays Prize in Computational Mathematical Programming, Mathematical Programming Society, first recipientVisiting Scientist, Special Year on Numerical Linear Algebra, University of Tennesseeand Oak Ridge National LaboratoryErskine Visiting Fellowship, University of Canterbury, New ZealandInventor Recognition Award, Office of Technology Licensing, Stanford UniversityIBM Faculty Partnership AwardBest Paper award (with M. P. Friedlander), ICCOPT 1, RPI, NYISI Highly Cited Researcher, Computer ScienceFirst Prize in software section (with H. H. Jin, M. W. Carter, and Y. Ye) StanfordBerkeley Innovators’ ChallengeISI Highly Cited Researcher, MathematicsElected Hon FRSNZ (Honorary Fellow of the Royal Society of New Zealand)SIAM Linear Algebra Prize (with S.-C. Choi and C. C. Paige), awarded three-yearlyby the SIAM Activity Group on Linear AlgebraInducted into Stanford University Invention Hall of Fame (Optimization software, withPhilip Gill, Walter Murray, Bruce Murtagh, and Margaret Wright)SIAM tigator with Walter MurrayAFOSR Annual budget 50,000DOEAnnual budget 316,000DOEAnnual budget 75,000NSFAnnual budget 100,000NSFAnnual budget 150,000NSFAnnual budget 172,000ONRAnnual budget 150,000ONRAnnual budget 163,000ONRAnnual budget 170,000ONRAnnual budget 180,000ONRAnnual budget 200,000Co-Principal Investigator with Stephen Boyd and David Donoho1998–2000NSFAnnual budget 133,000Co-Principal Investigator with Yinyu Ye2009–2012DOEAnnual budget 484,000 incl subcontracts to UCSD, Univ of IcelandPrincipal budgetbudgetbudgetbudget 114,000 373,000 incl subcontract to UCSD 100,000 133,000 (Ford Research and Innovation Center)IBM Faculty Partnership Award, 20,000General Motors, Work Systems Lab, faculty participantResearch Gift, Robert Bosch Corp, 25,000Contract, Robert Bosch Corp, 108,500Research Gift, COMSOL Inc, 42,000Birdseed Funding, Stanford OTL, 15,000Stanford/KAUST AEA Agreement, 100,000Member, Technical Area 4, AHPCRC, StanfordMember, Technical Area 1, AHPCRC, Stanford

Michael A. Saunders3Professional ANAssociation for Computing MachineryEU Academy of SciencesInstitute for Operations Research and the Management SciencesMathematical Optimization SocietyNumerical Algorithms Group LimitedOperational Research Society of New ZealandSociety for Industrial and Applied MathematicsSIAM Activity Group on OptimizationACM Fortran ForumProfessional 1420192021Associate Editor, ACM TOMS (ACM Transactions on Mathematical Software)Associate Editor, SIOPT (SIAM Journal on Optimization)Associate Editor, OPTE (Optimization and Engineering)Member, International Scientific Advisory Board, NZIMA (New Zealand Institute ofMathematics and its Applications)Associate Editor, NACO (Numerical Algebra, Control and Optimization)Co-organizer, Conference on Practical Optimization, Stanford UniversityMember, Orchard-Hays Prize committee, Mathematical Programming SocietyProposal Review panelist, NSF DMII, Production Systems and OROrganizer, Minisymposium, SIAM Conference on Optimization, AtlantaMember, Beale/Orchard-Hays Prize committee, Math. Programming SocietyMember, Dantzig Dissertation Prize committee, INFORMSProposal Review panelist, NSF DMII, Operations ResearchOrganizer, Minisymposium, SIAM Conference on Optimization, TorontoOrganizer, Minisymposium, IFORS Triennial Conference, HonoluluMember, Student Paper Competition committee, IMACSOrganizer, Minisymposium, ISMP Triennial Symposium, Rio de JaneiroCo-organizer, Stanford 50: Conference on State of the Art and Future Directions ofComputational Mathematics and Numerical Computing, Stanford UniversityOrganizer, Minisymposium, INFORMS Annual Meeting, SeattleCo-organizer, Symposium on Gene Golub’s Legacy: Matrix Computations –Foundation and Future, Stanford University, Mar 1Technical program committee, MELT08, First ACM International workshop on MobileEntity Localization and Tracking in GPS-less Environments, San FranciscoProposal Review panelist, NSF DMS, Numerical Linear Algebra and OptimizationCluster Chair, ISMP, ChicagoMinisymposium Organizer, SIAM Conf on Applied Linear Algebra, MontereyAdvisory Council, LATNA, National Research University Higher School of Economics,Nizhny Novgorod, RussiaCluster Chair, ISMP, BerlinCo-organizer, BIRS Workshop on Sparse Representations, Numerical Linear Algebra,and Optimization, BanffMinisymposium Co-organizer, ICCOPT, BerlinMinisymposium Co-organizer, SIAM OP21Referee for Journals, Publishers, Foundations, etcACM TOMS, Acta Numerica 2005, AFOSR, AMC, AOAS, APMOD, APNUM, Applied Numerical Mathematics, Bioinformatics, BIT Numerical Mathematics, BSF, Cambridge University Press,CDC04, COAP, CSDA, Econometrics, ELSCAM, EPSRC (Britain), European J. of Operational Research, FCAR (Canadian Research Foundation), GRIS, Hindawi Scientific Programming, HindawiShock and Vibration, HPSC, IEEE Signal Processing, IEEE TOIT, IJHPCA, IMA J. of Numerical

Michael A. Saunders4Analysis, IJHPCA, IMACS student paper competition, Institute of Physics J. on Inverse Problems,INFORMS JOC, International J. Mathematics in OR, International Science Foundation, InverseProblems, ISF, Italian Research and University Evaluation Agency, JCMDS, J. of CombinatorialOptimization, J. of Comp. and Applied Mathematics, J. of Comp. and Graphical Statistics, J. ofGlobal Optimization, J. of Industrial and Management Optimization, JMAA, JOSC, JOTA, JohnsHopkins University Press, JPC, LAA, MATCOM, MELT08, MMOR, Mathematical Programming,MPC, Mathematics and Computers in Simulation, NAOIII, NAOIV, NAOV, NSERC, NSF, Numerical Algorithms, Numerische Mathematik, NUMA, NZFRST, NZ J. of Mathematics, NZIMA, OMP,OMS, OPTE, ORSA J. on Computing, Parallel Processing Letters, PLOS ONE, PNAS, ResearchGrants Council (Hong Kong), RSNZ, SIAM, SIAM Spotlights, SIGPRO, SIMAX, SIOPT, SIREV,SISC, Springer, Swedish Research Council for Eng. Sciences, VQR (Italy), Wiley & eral ElectricBarraMcDonnell-Douglas (then Boeing)DemandTec (Science Advisory Board)Cardinal Optimization Inc (Chief Scientist)ProPlus Design Solutions (Technical Advisory Board)Sodao Network Technology (Board)Wellong Logistics Company (Chief Scientist)Inovelli Inc (Chief Scientist)Khai Long Cayman L.P. (Partner)ETAO (Advisory Board)Teaching1997EESOR 406 Colloquium, Winter and SpringEESOR 408 Tutorial (3 students)1998EESOR 406 Colloquium, WinterEESOR 408 Tutorial (2 students)Master’s class, Nonlinear Optimization, Engineering Science, University of Auckland,New Zealand (12 students)1999EESOR 406 Colloquium, WinterEESOR 408 Tutorial (1 student)2000MS&E 406 Colloquium, Winter and SpringMS&E 408 Tutorial (1 student)1989–2001SCCM Affiliated Faculty member2001–2003SCCM Core Faculty member2004–present ICME Affiliated Faculty member2001–2004CS 531 Linear Algebra Seminar2005–2020CME 510 Linear Algebra and Optimization Seminar2003–2018MS&E 318 Large-scale Numerical Optimization2015 JulyBlock course, Numerical Methods for Large-scale Optimization, USI Lugano2016 March Block course, Large-scale Optimization, USI Lugano2019ICME 338 Large-scale Numerical Optimization, http://stanford.edu/class/cme3382020–present College students, Introduction to MATLAB, InAmerica Education, New York, NYGraduate Advising19871988199120022003Engineer, R. EntrikenEngineer, S. K. EldersveldPhD co-principal advisor, S. K. EldersveldPhD principal advisor, M. P. Friedlander, M. J. O’Sullivan, B. KimPhD co-principal advisor, C.-M. Fransson

Michael A. 120142015201620162017201820192019–PhD co-principal advisor, Z. Su, H. H. JinPhD principal advisor, S.-C. ChoiPostdoctoral advisor, H. H. JinPhD co-principal advisor, C. GreenPhD principal advisor, H. M. HuynhPhD principal advisor, D. F. Gleich, L. TenenblatPostdoctoral co-advisor, D. KourounisPhD principal advisor, L. Deng, C. M. MaesPhD principal advisor, D. C.-L. FongPhD principal advisor, X. MengPhD principal advisor, S. Akle, Y. SunPhD principal advisor, J. YangMS advisor, Y. ParkMS advisor, S. KimPhD coadvisor, X. Suo, D. MaPhD principal advisor, R. Estrin (Co-winner, ICME Gene Golub Thesis Award)PhD coadvisor, S. ternal examiner, J. Eriksson, Linköping University, Swedenexternal examiner, M. Adlers, Linköping University, Swedenreading committee member, 92 studentsdefense committee member, 205 studentsContributions to Books[B1] P. E. Gill, W. Murray, B. A. Murtagh, M. A. Saunders, and M. H. Wright, GAMS/MINOS,in A. Brooke, D. Kendrick, and A. Meeraus, GAMS: A User’s Guide, The Scientific Press,Redwood City, CA, 201–224 (1988).[B2] P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright, Constrained nonlinear programming, in G. L. Nemhauser, A. H. G. Rinnooy Kan, and M. J. Todd (eds.), Optimization,Handbooks in Operations Research and Management Science, Volume 1, North-Holland, Amsterdam, 171–210 (1989).[B3] P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright, Some theoretical properties of anaugmented Lagrangian merit function, in P. M. Pardalos (ed.), Advances in Optimization andParallel Computing, North-Holland, Amsterdam, 101–128 (1992).[B4] M. A. Saunders, Cholesky-based methods for sparse least squares: The benefits of regularization, in L. Adams and J. L. Nazareth (eds.), Linear and Nonlinear Conjugate Gradient-RelatedMethods, SIAM, Philadelphia, 92–100 (1996).[B5] M. A. Saunders, Commentary on Methods for modifying matrix factorizations, in R. H. Chan,C. Greif, and D. P. O’Leary, Milestones in Matrix Computation: Selected Works of Gene H.Golub, With Commentaries, Oxford University Press, Oxford, 310–310 (2007).[B6] M. A. Saunders, Commentary on Pete Stewart’s contributions to least-squares backward errors, written for M. E. Kilmer and D. P. O’Leary (eds.), G. W. Stewart, Selected Works withCommentaries, Contemporary Mathematicians, Springer Science Business Media, LLC 2010.Referenced on pp 29, 50, 52,131. Available at t-LS-backward-errors.pdf.[B7] D. Ma and M. A. Saunders, Solving multiscale linear programs using the simplex methodin quadruple precision, pp 223–235 in M. Al-Baali, L. Grandinetti, and A. Purnama (eds.),Numerical Analysis and Optimization, NAO-III, Muscat, Oman, January 2014, Springer Proceedings in Mathematics & Statistics, Volume 134, Springer International Publishing Switzerland (2015).[B8] P. E. Gill, M. A. Saunders, and E. Wong, On the performance of SQP methods for nonlinearoptimization, in B. Defourny and T. Terlaky (eds.), Modeling and Optimization: Theory and

Michael A. Saunders6Applications, MOPTA, Bethlehem, PA, USA, August 2014, Springer Proceedings in Mathematics & Statistics, Volume 147, Springer International Publishing AG (2015).[B9] D. Ma, K. L. Judd, D. Orban and M. A. Saunders, Stabilized optimization via an NCLalgorithm, pp 173–191 in M. Al-Baali, L. Grandinetti, and A. Purnama (eds.), NumericalAnalysis and Optimization, NAO-IV, Muscat, Oman, January 2017, Springer Proceedings inMathematics & Statistics, Volume 235, Springer International Publishing AG (2018), https://link.springer.com/conference/nao.[B10] D. Ma, D. Orban and M. A. Saunders, A Julia implementation of Algorithm NCL for constrained optimization, pp 153–182 in M. Al-Baali, A. Purnama, and L. Grandinetti (eds.),Numerical Analysis and Optimization, NAO-V, Muscat, Oman, January 2020, Springer Proceedings in Mathematics & Statistics, Volume 354, Springer International Publishing AG(2021), https://link.springer.com/conference/nao.Refereed Journal Articles[J1] P. E. Gill, G. H. Golub, W. Murray, and M. A. Saunders, Methods for modifying matrixfactorizations, Math. Comput. 28, 505–535 (1974).[J2] P. E. Gill, W. Murray, and M. A. Saunders, Methods for computing and modifying the LDVfactors of a matrix, Math. Comput. 29, 1051–1077 (1975).[J3] C. C. Paige and M. A. Saunders, Solution of sparse indefinite systems of linear equations,SIAM J. Numer. Anal. 12, 617–629 (1975).[J4] C. C. Paige and M. A. Saunders, Least squares estimation of discrete linear dynamic systemsusing orthogonal transformations, SIAM J. Numer. Anal. 14, 180–193 (1977).[J5] B. A. Murtagh and M. A. Saunders, Large-scale linearly constrained optimization, Math.Program. 14, 41–72 (1978).[J6] C. C. Paige and M. A. Saunders, Towards a generalized singular value decomposition, SIAMJ. Numer. Anal. 18, 398–405 (1981).[J7] P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright, Aspects of mathematical modellingrelated to optimization, Applied Mathematical Modelling 5, 71–83 (1981).[J8] P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright, A note on a sufficient decreasecriterion for a non-derivative steplength procedure, Math. Program. 23, 349–352 (1982).[J9] B. A. Murtagh and M. A. Saunders, A projected Lagrangian algorithm and its implementationfor sparse nonlinear constraints, Math. Program. Stud. 16 (Constrained Optimization), 84–117(1982).[J10] C. C. Paige and M. A. Saunders, LSQR: An algorithm for sparse linear equations and sparseleast squares, ACM Trans. Math. Softw. 8(1), 43–71 (1982).[J11] C. C. Paige and M. A. Saunders, Algorithm 583; LSQR: Sparse linear equations and leastsquares problems, ACM Trans. Math. Softw. 8(2), 195–209 (1982).[J12] P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright, Computing forward-differenceintervals for numerical optimization, SIAM J. Sci. Statist. Comput. 4, 310–321 (1983).[J13] P. E. Gill, N. I. M. Gould, W. Murray, M. A. Saunders, and M. H. Wright, A weighted GramSchmidt method for convex quadratic programming, Math. Program. 30, 176–195 (1984).[J14] P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright, Sparse matrix methods in optimization, SIAM J. Sci. Statist. Comput. 5, 562–589 (1984).[J15] P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright, Procedures for optimizationproblems with a mixture of bounds and general constraints, ACM Trans. Math. Softw. 10,282–298 (1984).[J16] P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright, Trends in nonlinear programmingsoftware, European J. of Operational Research 17, 141–149 (1984).

Michael A. Saunders7[J17] S. M. Gorelick, C. I. Voss, P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright, Aquiferreclamation design: the use of contaminant transport simulation combined with nonlinearprogramming, Water Resources Research 20, 415–427 (1984).[J18] P. E. Gill, W. Murray, M. A. Saunders, G. W. Stewart, and M. H. Wright, Properties of arepresentation of a basis for the null space, Math. Program. 33, 172–186 (1985).[J19] P. E. Gill, W. Murray, M. A. Saunders, J. A. Tomlin, and M. H. Wright, On projected Newtonbarrier methods for linear programming and an equivalence to Karmarkar’s projective method,Math. Program. 36, 183–209 (1986).[J20] P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright, Maintaining LU factors of a generalsparse matrix, Linear Algebra Appl. 88/89, 239–270 (1987).[J21] M. A. Saunders, H. D. Simon, and E. L. Yip, Two conjugate-gradient-type methods forunsymmetric linear equations, SIAM J. Numer. Anal. 25, 927–940 (1988).[J22] P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright, Recent developments in constrainedoptimization, J. Computational and Applied Mathematics 22, 257–270 (1988).[J23] P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright, A practical anti-cycling procedurefor linearly constrained optimization, Math. Program. 45, 437–474 (1989).[J24] P. E. Gill, W. Murray, M. A. Saunders, and M. H. Wright, Inertia-controlling methods forgeneral quadratic programming, SIAM Rev. 33, 1–36 (1991).[J25] F. Jarre and M. A. Saunders, An adaptive primal-dual method for linear programming, Math.Prog. Soc., Committee on Algorithms Newsletter 19, 7–16 (1991).[J26] S. K. Eldersveld and M. A. Saunders, A block-LU update for large-scale linear programming,SIAM J. Matrix Anal. Appl. 13, 191–201 (1992).[J27] P. E. Gill, W. Murray, D. B. Ponceleón and M. A. Saunders, Preconditioners for indefinitesystems arising in optimization, SIAM J. Matrix Anal. Appl. 13, 292–311 (1992).[J28] M. A. Saunders, Major Cholesky would feel proud, ORSA J. Comput. 6, 23–27 (1994).[J29] H.-D. Chen, P. M. Pardalos, and M. A. Saunders, The simplex algorithm with a new primaland dual pivot rule, Oper. Res. Lett. 16, 121–127 (1994).[J30] F. Jarre and M. A. Saunders, A practical interior-point method for convex programming,SIAM J. Optim. 5, 149–171 (1995).[J31] J. W. Chinneck and M. A. Saunders, MINOS(IIS) version 4.2: Analyzing infeasibilities inlinear programming, Eur. J. Oper. Res. 81, 217–218 (1995).[J32] P. E. Gill, W. Murray, D. B. Ponceleón, and M. A. Saunders, Primal-dual methods for linearprogramming, Math. Program. 70, 251–277 (1995).[J33] M. A. Saunders, Solution of sparse rectangular systems using LSQR and CRAIG, BIT Numerical Mathematics 35, 588–604 (1995).[J34] P. E. Gill, M. A. Saunders, and J. R. Shinnerl, On the stability of Cholesky factorization forquasi-definite systems, SIAM J. Matrix Anal. Appl. 17(1), 35–46 (1996).[J35] M. A. Saunders, Computing projections with LSQR, BIT Numerical Mathematics 37:1, 96–104 (1997).[J36] W. R. Purcell, L.-X. Cheng, D. D. Dixon, R. L. Kinzer, J. D. Kurfess, M. Leventhal,M. A. Saunders, J. G. Skibo, D. M. Smith, and J. Tueller, OSSE mapping of galactic 511 keVpositron annihilation line emission, Astrophysical J. 491, 725–776, Dec. 1997.[J37] S. S. Chen, D. L. Donoho, and M. A. Saunders, Atomic decomposition by basis pursuit, SIAMJ. Sci. Comput. 20(1), 33–61 (1998).[J38] S. S. Chen, D. L. Donoho, and M. A. Saunders, Atomic decomposition by basis pursuit,SIGEST article, SIAM Rev. 43(1), 129–159 (2001).[J39] P. E. Gill, W. Murray, and M. A. Saunders, SNOPT: An SQP algorithm for large-scaleconstrained optimization, SIAM J. Optim. 12(4), 979–1006 (2002).

Michael A. Saunders8[J40] M. Jacobsen, P. C. Hansen, and M. A. Saunders, Subspace preconditioned LSQR for discreteill-posed problems, BIT Numerical Mathematics 43:5, 975–989 (2003).[J41] M. P. Friedlander and M. A. Saunders, A globally convergent linearly constrained Lagrangian method for nonlinear optimization, SIAM J. Optim. 15(3), 863–897 (2005).[J42] R. Tibshirani, M. Saunders, S. Rosset, J. Zhu, and K. Knight, Sparsity and smoothness viathe fused lasso, J. Royal Statistical Society B 67(1), 91–108 (2005).[J43] P. E. Gill, W. Murray, and M. A. Saunders, SNOPT: An SQP algorithm for large-scaleconstrained optimization, SIGEST article, SIAM Rev. 47(1), 99–131 (2005).[J44] M. W. Carter, H. H. Jin, M. A. Saunders, and Y. Ye, SpaseLoc: An adaptive subproblemalgorithm for scalable wireless sensor network localization, SIAM J. Optim. 17(4), 1102–1128(2006).[J45] M. P. Friedlander and M. A. Saunders, Discussion: The Dantzig selector: Statistical estimation when p is much larger than n, Annals of Statistics 35(6), 2385–2391 (2007).[J46] P. E. Gill, W. Murray, M. A. Saunders, J. A. Tomlin, and M. H. Wright, George B. Dantzig andsystems optimization, J. Discrete Optimization 5(2), 151–158 (2008), in memory of GeorgeB. Dantzig. 7] G. Chantas, N. Galatsanos, A. Likas, and M. A. Saunders, Variational Bayesian image restoration based on a product of t-distributions image prior, IEEE Trans. Image Processing 17(10),1795–1805 (2008).[J48] C.-M. Fransson, T. Wik, B. Lennartson, M. A. Saunders, and P.-O. Gutman, Nonconservative robust control: Optimized and constrained sensitivity functions, IEEE Trans. Contr.Sys. Tech. 17(2), 298–308 (2009).[J49] M. J. O’Sullivan and M. A. Saunders, Stabilizing policy improvement for large-scale infinitehorizon dynamic programming, SIAM J. Matrix Anal. Appl. 31(2), 434–459 (2009).[J50] V. Pereyra, M. A. Saunders, and J. Castillo, Equispaced Pareto front construction forconstrained bi-objective optimization, Mathematical and Computer Modelling (2011), doi:10.1016/j.mcm.2010.12.044, 10 pp.[J51] S.-C. Choi, C. C. Paige, and M. A. Saunders, MINRES-QLP: a Krylov subspace methodfor indefinite or singular symmetric systems, SIAM J. Sci. Comput. 33:4 (2011) 1810–1836.(2012 Linear Algebra Prize, SIAM Activity Group on Linear Algebra.)[J52] D. C.-L. Fong and M. A. Saunders, LSMR: An iterative algorithm for sparse least-squaresproblems, SIAM J. Sci. Comput. 33:5 (2011) 2950–2971, Copper Mountain Special Issue 2010.[J53] R. M. T. Fleming, C. M. Maes, M. A. Saunders, Y. Ye, and B. Ø. Palsson, A variationalprinciple for computing nonequilibrium fluxes and potentials in genome-scale biochemicalnetworks, J. Theoretical Biology 292 (2012) 71–77.[J54] S. P. Ponnapalli, M. A. Saunders, C. F. Van Loan, and O. Alter, A higher-order generalized singular value decomposition for comparison of global mRNA expression from multipleorganisms, PLoS ONE 6(12): e28072 (2011), 11 pp. doi:10.1371/journal.pone.0028072.[J55] D. C.-L. Fong and M. A. Saunders, CG versus MINRES: An empirical comparison, SQUJournal for Science 17:1 (2012) 44–62.[J56] P. Berman, A. Leshem, O. Etziony, O. Levi, Y. Parmet, M. Saunders, and Z. Wiesman, Novel1H low field nuclear magnetic resonance applications for the field of biodiesel, Biotechnologyfor Biofuels 6:55 (2013) 20 pp.[J57] P. Berman, O. Levi, Y. Parmet, M. Saunders, and Z. Wiesman, Laplace inversion of lowresolution NMR relaxometry data using sparse representation methods, Concepts in MagneticResonance Part A 42A:3 (2013) 72–88.[J58] Y. Sun, R. M. T. Fleming, I. Thiele, and M. A. Saunders, Robust flux balance analysis ofmultiscale biochemical reaction networks, BMC Bioinformatics 14:240, 2013, 6 pp.

Michael A. Saunders9[J59] S.-C. Choi and M. A. Saunders, Algorithm 937: MINRES-QLP for symmetric and Hermitianlinear equations and least-squares problems, ACM Trans. Math. Softw. 40(2), Article 16, Feb2014, 12 pp.[J60] X. Meng, M. A. Saunders, and M. W. Mahoney, LSRN: a parallel iterative solver for stronglyover- or underdetermined systems, SIAM J. Sci. Comput. 36:2 (2014) C95–C118. http://arxiv.org/abs/1109.5981.[J61] J. D. Lee, Y. Sun, and M. A. Saunders, Proximal Newton-type methods for minimizingcomposite functions, SIAM J. Optim. 24:3 (2014) 1420–1443. http://arxiv.org/abs/1206.1623.[J62] Y. Choi, C. Farhat, W. Murray, and M. Saunders, A practical factorization of a Schurcomplement for PDE-constrained distributed optimal control, J. Sci. Comput. 2014. DOI10.1007/s10915-014-9976-0.[J63] P. Berman, N. Meiri, L. A. Colnago, T. B. Moraes, C. Linder, O. Levi, Y. Parmet, M. Saunders,and Z. Wiesman, Study of liquid-phase molecular packing interactions and morphology offatty acid methyl esters (biodiesel), Biotechnology for Biofuels 8:12 (2015). DOI 10.1186/s13068-014-0194-7, 16 pp.[J64] L. Yang, J. Tan, E. J. O’Brien, J. M. Monk, D. Kim, H. J. Li, P. Charusanti, A. Ebrahim, C.J. Lloyd, J. T. Yurkovich, B. Du, A. Dräger, A. Thomas, Y. Sun, M. A. Saunders, and B.O. Palsson, Systems biology definition of the core proteome of metabolism and expression isconsistent with high-throughput data, PNAS (2015). DOI 10.1073/pnas.1501384112.[J65] A. Ebrahim, E. Almaas, E. Bauer, A Bordbar, AP Burgard, RL Chang, A. Dräger, I. Famili,A. M. Feist, R. M. T. Fleming, S. S. Fong, V. Hatzimanikatis, M. J. Herrgård, A. Holder,M. Hucka, D. Hyduke, N. Jamshidi, S. Y. Lee, N. Le, Novère, J. A. Lerman, N. E. Lewis,D. Ma, R. Mahadevan, C. Maranas, H. Nagarajan, A. Navid, J. Nielsen, L. K. Nielsen, J.Nogales, A. Noronha, C. Pal, B. O. Palsson, J. A. Papin, K. R. Patil, N. D. Price, J. L. Reed,M. Saunders, R. S. Senger, N. Sonnenschein, Y. Sun, and I. Thiele, Do genome-scale modelsneed exact solvers or clearer standards?, Molecular Systems Biology 11:831 (2015), 3 pp.[J66] S. Tejman-Yarden, O. Levi, A. Beizerov, Y. Parmet, T. Nguyen, M. Saunders, Z. Rudich, J. C.Perry, D. G. Baker, T. Moeller-Bertram, Heart rate analysis by sparse representation for acutepain detection, Med. Biol. Eng. Comput. 54:595 (2016). DOI 10.1007/s11517-015-1350-3.[J67] R. M. T. Fleming, N. Vlassis, I. Thiele, and M. A. Saunders, Conditions for duality betweenfluxes and concentrations in biochemical networks, J. Theoretical Biology, 409, 1–10 (2016).http://arxiv.org/abs/1512.02690v1.[J68] L. Yang, D. Ma, A. Ebrahim, C. J. Lloyd, M. A. Saunders, and B. O. Palsson, solveME: fastand reliable solution of nonlinear ME models, BMC Bioinformatics, 17:391 (10 pages) (2016).[J69] L. Yang, J. T. Yurkovich, C. J. Lloyd, A. Ebrahim, M. A. Saunders and B. O. Palsson,Principles of proteome allocation are revealed using proteomic data and genome-scale models,Scientific Reports 6, 36734 (2016). https://www.nature.com/articles/srep36734.[J70] D. Ma, L. Yang, R. M. T. Fleming, I. Thiele, B. O. Palsson and M. A. Saunders, Reliableand efficient solution of genome-scale models of Metabolism and macromolecular Expression,Scientific Reports 7, 40863 (2017). https://www.nature.com/articles/srep40863.[J71] L. Yang, A. Ebrahim, C. J. Lloyd, M. A. Saunders and B. O. Palsson. DynamicME: dynamicsimulation and refinement of integrated models of metabolism and protein expression, BMCSystems Biology 13:2 (2019). https://rdcu.be/bf1NB.[J72] R. Estrin, D. Orban and M. A. Saunders, Euclidean-norm error bounds for SYMMLQand CG, SIAM J. Matrix Anal. Appl. 40(1) 235–253 (2019). https://doi.org/10.1137/16M1094816.[J73] L. Heirendt, S. Arreckx, et al. (including D. Ma, Y. Sun, M. A. Saunders, B. O. Palsson,I. Thiele, and R. M. T. Fleming), Creation and analysis of biochemical constraint-basedmodels: the COBRA Toolbox v3.0, Nature Protocols (2019). http://dx.doi.org/10.1038/s41596-018-0098-2.

Michael A. Saunders10[J74] R. Estrin, D. Orban and M. A. Saunders, LSLQ: An iterative method for linear leastsquares with an error minimization property, SIAM J. Matrix Anal. Appl. 40(1) 254–275(2019). https://dx.doi.org/10.1137/17M1113552.[J75] R. Estrin, D. Orban and M. A. Saunders, LNLQ: An iterative method for least-norm problems with an error minimization property, SIAM J. Matrix Anal. Appl. 40(3) 1102–1124(2019). https://doi.org/10.1137/18M1194948.[J76] S. Campisi-Pinto, O. Levi, D. Benson, M. T. Resende, M. Saunders, C. Linder, and Z. Wiesman. Simulation-based sensitivity analysis of regularization parameters for robust reconstruction of complex material’s T1 –T2 1 H LF-NMR energy relaxation signals, Appl. Magn. Reson., published online: 19 Nov 2019. https://doi.org/10.1007/s00723-019-01173-1.[J77] R. Estrin, M. P. Friedlander, D. Orban and M. A. Saunders, Implementing a smooth exactpenalty function for equality-constrained nonlinear optimization, SIAM J. Sci. Comput. 42(3)A1809–A1835. https://doi.org/10.1137/19M1238265 (2020).[J78] R. Estrin, M. P. Friedlander, D. Orban and M. A. Saunders, Implementing a smooth exactpenalty function for general constrained nonlinear optimization, SIAM J. Sci.

2000{2011 DemandTec (Science Advisory Board) 2007{2021 Cardinal Optimization Inc (Chief Scientist) 2011{2013 ProPlus Design Solutions (Technical Advisory Board) 2012{2013 Sodao Network Technology (Board) 2013{present Wellong Logistics Company (Chief Scientist) 2016{present Inovelli Inc (Chie