default search action
Michael A. Saunders
Person information
- affiliation: Stanford University, Department of Management Science and Engineering, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [i20]Kasia Swirydowicz, Nicholson Koukpaizan, Maksudul Alam, Shaked Regev, Michael A. Saunders, Slaven Peles:
Iterative Methods in GPU-Resident Linear Solvers for Nonlinear Constrained Optimization. CoRR abs/2401.13926 (2024) - [i19]Na Huang, Yu-Hong Dai, Dominique Orban, Michael A. Saunders:
An inexact augmented Lagrangian algorithm for unsymmetric saddle-point systems. CoRR abs/2404.14636 (2024) - [i18]Johannes J. Brust, Michael A. Saunders:
Structured Sketching for Linear Systems. CoRR abs/2407.00746 (2024) - 2023
- [j50]Shaked Regev
, Naiyuan Chiang, Eric Darve, Cosmin G. Petra, Michael A. Saunders
HyKKT: a hybrid direct-iterative method for solving KKT linear systems. Optim. Methods Softw. 38(2): 332-355 (2023) - [j49]Na Huang
Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems. Optim. Methods Softw. 38(5): 887-913 (2023) - [j48]Johannes J. Brust
PLSS: A Projected Linear Systems Solver. SIAM J. Sci. Comput. 45(2): 1012- (2023) - [j47]Na Huang
On GSOR, the Generalized Successive Overrelaxation Method for Double Saddle-Point Problems. SIAM J. Sci. Comput. 45(5): 2185- (2023) - [i17]Alexis Montoison, Dominique Orban, Michael A. Saunders:
MinAres: An Iterative Solver for Symmetric Linear Systems. CoRR abs/2310.01757 (2023) - 2022
- [j46]Alexandre Ghannad, Dominique Orban, Michael A. Saunders
Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number. Optim. Methods Softw. 37(4): 1344-1369 (2022) - [j45]Kasia Swirydowicz, Eric Darve
Linear solvers for power grid optimization problems: A review of GPU-accelerated linear solvers. Parallel Comput. 111: 102870 (2022) - [j44]Johannes J. Brust
Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation. SIAM J. Sci. Comput. 44(1): 103- (2022) - [i16]Na Huang, Yu-Hong Dai, Dominique Orban, Michael A. Saunders:
A semi-conjugate gradient method for solving unsymmetric positive definite linear systems. CoRR abs/2206.02951 (2022) - [i15]Johannes J. Brust, Michael A. Saunders:
PLSS: A Projected Linear Systems Solver. CoRR abs/2207.07615 (2022) - [i14]Na Huang, Yu-Hong Dai, Dominique Orban, Michael A. Saunders:
On GSOR, the Generalized Successive Overrelaxation Method for Double Saddle-Point Problems. CoRR abs/2208.07499 (2022) - 2021
- [i13]Ding Ma, Dominique Orban, Michael A. Saunders:
A Julia implementation of Algorithm NCL for constrained optimization. CoRR abs/2101.02164 (2021) - [i12]Johannes J. Brust, Roummel F. Marcia, Cosmin G. Petra, Michael A. Saunders:
Large-scale Optimization with Linear Equality Constraints using Reduced Compact Representation. CoRR abs/2101.11048 (2021) - [i11]Kasia Swirydowicz, Eric Darve, Wesley B. Jones, Jonathan Maack, Shaked Regev, Michael A. Saunders, Stephen J. Thomas, Slaven Peles:
Linear solvers for power grid optimization problems: a review of GPU-accelerated linear solvers. CoRR abs/2106.13909 (2021) - [i10]Shaked Regev, Naiyuan Chiang, Eric Darve, Cosmin G. Petra, Michael A. Saunders, Kasia Swirydowicz, Slaven Peles:
A Hybrid Direct-Iterative Method for Solving KKT Linear Systems. CoRR abs/2110.03636 (2021) - [i9]Ali Eshragh, Oliver Di Pietro, Michael A. Saunders:
Toeplitz Least Squares Problems, Fast Algorithms and Big Data. CoRR abs/2112.12994 (2021) - 2020
- [j43]Ron Estrin
Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization. SIAM J. Sci. Comput. 42(3): A1809-A1835 (2020) - [j42]Ron Estrin
Implementing a Smooth Exact Penalty Function for General Constrained Nonlinear Optimization. SIAM J. Sci. Comput. 42(3): A1836-A1859 (2020)
2010 – 2019
- 2019
- [j41]Laurence Yang
DynamicME: dynamic simulation and refinement of integrated models of metabolism and protein expression. BMC Syst. Biol. 13(1): 2:1-2:15 (2019) - [j40]Ron Estrin, Dominique Orban, Michael A. Saunders
Euclidean-Norm Error Bounds for SYMMLQ and CG. SIAM J. Matrix Anal. Appl. 40(1): 235-253 (2019) - [j39]Ron Estrin, Dominique Orban, Michael A. Saunders
LSLQ: An Iterative Method for Linear Least-Squares with an Error Minimization Property. SIAM J. Matrix Anal. Appl. 40(1): 254-275 (2019) - [j38]Ron Estrin, Dominique Orban, Michael 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) - [c5]Laurence Yang, Michael A. Saunders
Estimating Cellular Goals from High-Dimensional Biological Data. KDD 2019: 2202-2211 - [i8]Ron Estrin, Michael P. Friedlander, Dominique Orban, Michael A. Saunders:
Implementing a smooth exact penalty function for equality-constrained nonlinear optimization. CoRR abs/1910.04300 (2019) - [i7]Ron Estrin, Michael P. Friedlander, Dominique Orban, Michael A. Saunders:
Implementing a smooth exact penalty function for general constrained nonlinear optimization. CoRR abs/1912.02093 (2019) - 2017
- [i6]Drosos Kourounis, Leonidas Gergidis, Michael A. Saunders, Andrea Walther, Olaf Schenk:
Compile-Time Symbolic Differentiation Using C++ Expression Templates. CoRR abs/1705.01729 (2017) - 2016
- [j37]Laurence Yang, Ding Ma
solveME: fast and reliable solution of nonlinear ME models. BMC Bioinform. 17: 391 (2016) - [j36]Shai Tejman-Yarden, Ofer Levi, Alex Beizerov, Yisrael Parmet
Heart rate analysis by sparse representation for acute pain detection. Medical Biol. Eng. Comput. 54(4): 595-606 (2016) - [c4]Jiyan Yang, Michael W. Mahoney, Michael A. Saunders, Yuekai Sun:
Feature-distributed sparse regression: a screen-and-clean approach. NIPS 2016: 2712-2720 - 2015
- [j35]Youngsoo Choi
A Practical Factorization of a Schur Complement for PDE-Constrained Distributed Optimal Control. J. Sci. Comput. 65(2): 576-597 (2015) - 2014
- [j34]Jason D. Lee
Proximal Newton-Type Methods for Minimizing Composite Functions. SIAM J. Optim. 24(3): 1420-1443 (2014) - [j33]Xiangrui Meng, Michael A. Saunders
LSRN: A Parallel Iterative Solver for Strongly Over- or Underdetermined Systems. SIAM J. Sci. Comput. 36(2) (2014) - [j32]Sou-Cheng T. Choi, Michael A. Saunders
Algorithm 937: MINRES-QLP for symmetric and Hermitian linear equations and least-squares problems. ACM Trans. Math. Softw. 40(2): 16:1-16:12 (2014) - [c3]Evrim Acar, Mathias Nilsson, Michael A. Saunders:
A flexible modeling framework for coupled matrix and tensor factorizations. EUSIPCO 2014: 111-115 - 2013
- [j31]Yuekai Sun, Ronan M. T. Fleming
Robust flux balance analysis of multiscale biochemical reaction networks. BMC Bioinform. 14: 240 (2013) - [j30]Víctor Pereyra, Michael A. Saunders
Equispaced Pareto front construction for constrained bi-objective optimization. Math. Comput. Model. 57(9-10): 2122-2131 (2013) - [i5]Sou-Cheng T. Choi, Michael A. Saunders:
ALGORITHM xxx: MINRES-QLP for Singular Symmetric and Hermitian Linear Equations and Least-Squares Problems. CoRR abs/1301.2707 (2013) - 2012
- [c2]Jason D. Lee, Yuekai Sun, Michael A. Saunders:
Proximal Newton-type methods for convex optimization. NIPS 2012: 836-844 - [i4]Jason D. Lee, Yuekai Sun, Michael A. Saunders:
Proximal Newton-type Methods for Minimizing Convex Objective Functions in Composite Form. CoRR abs/1206.1623 (2012) - 2011
- [j29]Sou-Cheng T. Choi, Christopher C. Paige, Michael A. Saunders
MINRES-QLP: A Krylov Subspace Method for Indefinite or Singular Symmetric Systems. SIAM J. Sci. Comput. 33(4): 1810-1836 (2011) - [j28]David Chin-Lung Fong, Michael A. Saunders:
LSMR: An Iterative Algorithm for Sparse Least-Squares Problems. SIAM J. Sci. Comput. 33(5): 2950-2971 (2011) - [i3]Xiangrui Meng, Michael A. Saunders, Michael W. Mahoney:
LSRN: A Parallel Iterative Solver for Strongly Over- or Under-Determined Systems. CoRR abs/1109.5981 (2011) - 2010
- [i2]Sou-Cheng T. Choi, Christopher C. Paige, Michael A. Saunders:
MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems. CoRR abs/1003.4042 (2010) - [i1]David Chin-Lung Fong, Michael A. Saunders:
LSMR: An iterative algorithm for sparse least-squares problems. CoRR abs/1006.0758 (2010)
2000 – 2009
- 2009
- [j27]Michael J. O'Sullivan
Stabilizing Policy Improvement for Large-Scale Infinite-Horizon Dynamic Programming. SIAM J. Matrix Anal. Appl. 31(2): 434-459 (2009) - [j26]Carl-Magnus Fransson, Torsten Wik
Nonconservative Robust Control: Optimized and Constrained Sensitivity Functions. IEEE Trans. Control. Syst. Technol. 17(2): 298-308 (2009) - 2008
- [j25]Philip E. Gill, Walter Murray, Michael A. Saunders
George B. Dantzig and systems optimization. Discret. Optim. 5(2): 151-158 (2008) - [j24]Giannis K. Chantas, Nikolas P. Galatsanos, Aristidis Likas, Michael A. Saunders
Variational Bayesian Image Restoration Based on a Product of t-Distributions Image Prior. IEEE Trans. Image Process. 17(10): 1795-1805 (2008) - 2007
- [p1]Gene H. Golub, Philip E. Gill, Walter Murray, Michael A. Saunders:
Methods for modifying matrix factorizations. Milestones in Matrix Computation 2007: 309-344 - 2006
- [j23]Michael W. Carter
SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization. SIAM J. Optim. 17(4): 1102-1128 (2006) - 2005
- [j22]Michael P. Friedlander
A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization. SIAM J. Optim. 15(3): 863-897 (2005) - [j21]Philip E. Gill, Walter Murray, Michael A. Saunders
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization. SIAM Rev. 47(1): 99-131 (2005) - 2004
- [c1]Carl-Magnus Fransson, Michael A. Saunders:
A bisection algorithm for the mixed μ upper bound and its supremum. ACC 2004: 2665-2670 - 2002
- [j20]Philip E. Gill, Walter Murray, Michael A. Saunders:
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization. SIAM J. Optim. 12(4): 979-1006 (2002) - 2001
- [j19]Scott Shaobing Chen, David L. Donoho, Michael A. Saunders:
Atomic Decomposition by Basis Pursuit. SIAM Rev. 43(1): 129-159 (2001)
1990 – 1999
- 1998
- [j18]Scott Shaobing Chen, David L. Donoho, Michael A. Saunders:
Atomic Decomposition by Basis Pursuit. SIAM J. Sci. Comput. 20(1): 33-61 (1998) - 1996
- [j17]Philip E. Gill, Michael A. Saunders, Joseph R. Shinnerl:
On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems. SIAM J. Matrix Anal. Appl. 17(1): 35-46 (1996) - 1995
- [j16]Philip E. Gill, Walter Murray, Dulce B. Ponceleon, Michael A. Saunders:
Primal - dual methods for linear programming. Math. Program. 70: 251-277 (1995) - [j15]Florian Jarre, Michael A. Saunders:
A Practical Interior-Point Method for Convex Programming. SIAM J. Optim. 5(1): 149-171 (1995) - 1994
- [j14]Michael A. Saunders:
Commentary - Major Cholesky Would Feel Proud. INFORMS J. Comput. 6(1): 23-27 (1994) - [j13]Hsin-Der Chen, Panos M. Pardalos, Michael A. Saunders:
The simplex algorithm with a new primal and dual pivot rule. Oper. Res. Lett. 16(3): 121-127 (1994) - 1992
- [j12]Samuel K. Eldersveld, Michael A. Saunders:
A Block-LU Update for Large-Scale Linear Programming. SIAM J. Matrix Anal. Appl. 13(1): 191-201 (1992) - [j11]Philip E. Gill, Walter Murray, Dulce B. Ponceleón, Michael A. Saunders:
Preconditioners for Indefinite Systems Arising in Optimization. SIAM J. Matrix Anal. Appl. 13(1): 292-311 (1992) - 1991
- [j10]Philip E. Gill, Walter Murray, Michael A. Saunders, Margaret H. Wright:
Inertia-Controlling Methods for General Quadratic Programming. SIAM Rev. 33(1): 1-36 (1991)
1980 – 1989
- 1989
- [j9]Philip E. Gill, Walter Murray, Michael A. Saunders, Margaret H. Wright:
A practical anti-cycling procedure for linearly constrained optimization. Math. Program. 45(1-3): 437-474 (1989) - 1986
- [j8]Philip E. Gill, Walter Murray, Michael A. Saunders, John A. Tomlin, Margaret H. Wright:
On projected newton barrier methods for linear programming and an equivalence to Karmarkar's projective method. Math. Program. 36(2): 183-209 (1986) - 1985
- [j7]Philip E. Gill, Walter Murray, Michael A. Saunders, G. W. Stewart, Margaret H. Wright:
Properties of a representation of a basis for the null space. Math. Program. 33(2): 172-186 (1985) - 1984
- [j6]Philip E. Gill, Nicholas I. M. Gould
A weighted gram-schmidt method for convex quadratic programming. Math. Program. 30(2): 176-195 (1984) - [j5]Philip E. Gill, Walter Murray, Michael A. Saunders, Margaret H. Wright:
Procedures for optimization problems with a mixture of bounds and general linear constraints. ACM Trans. Math. Softw. 10(3): 282-298 (1984) - 1982
- [j4]Philip E. Gill, Walter Murray, Michael A. Saunders, Margaret H. Wright:
A note on a sufficient-decrease criterion for a non-derivative step-length procedure. Math. Program. 23(1): 349-352 (1982) - [j3]Christopher C. Paige, Michael A. Saunders:
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares. ACM Trans. Math. Softw. 8(1): 43-71 (1982) - [j2]Christopher C. Paige, Michael A. Saunders:
Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems. ACM Trans. Math. Softw. 8(2): 195-209 (1982)
1970 – 1979
- 1978
- [j1]Bruce A. Murtagh, Michael A. Saunders:
Large-scale linearly constrained optimization. Math. Program. 14(1): 41-72 (1978) - 1972
- [b1]Michael A. Saunders:
Large-scale linear programming using the Cholesky factorization. Stanford University, USA, 1972
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-14 23:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: