Michael A. Saunders

Publication Activity (10 Years)

Years Active: 1978-2024
Publications (10 Years): 33

Top Topics

Symmetric Positive Definite

Constrained Optimization

Conjugate Gradient

Top Venues

SIAM J. Sci. Comput.

SIAM J. Matrix Anal. Appl.

Optim. Methods Softw.

Publications

Johannes J. Brust, Michael A. Saunders
Structured Sketching for Linear Systems. CoRR (2024)
Na Huang, Yu-Hong Dai, Dominique Orban, Michael A. Saunders
An inexact augmented Lagrangian algorithm for unsymmetric saddle-point systems. CoRR (2024)
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 (2024)
Shaked Regev, Naiyuan Chiang, Eric Darve, Cosmin G. Petra, Michael A. Saunders, Kasia Swirydowicz, Slaven Peles
HyKKT: a hybrid direct-iterative method for solving KKT linear systems. Optim. Methods Softw. 38 (2) (2023)
Na Huang, Yu-Hong Dai, Dominique Orban, Michael A. Saunders
On GSOR, the Generalized Successive Overrelaxation Method for Double Saddle-Point Problems. SIAM J. Sci. Comput. 45 (5) (2023)
Na Huang, Yu-Hong Dai, Dominique Orban, Michael A. Saunders
Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems. Optim. Methods Softw. 38 (5) (2023)
Johannes J. Brust, Michael A. Saunders
PLSS: A Projected Linear Systems Solver. SIAM J. Sci. Comput. 45 (2) (2023)
Alexis Montoison, Dominique Orban, Michael A. Saunders
MinAres: An Iterative Solver for Symmetric Linear Systems. CoRR (2023)
Johannes J. Brust, Roummel F. Marcia, Cosmin G. Petra, Michael A. Saunders
Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation. SIAM J. Sci. Comput. 44 (1) (2022)
Na Huang, Yu-Hong Dai, Dominique Orban, Michael A. Saunders
On GSOR, the Generalized Successive Overrelaxation Method for Double Saddle-Point Problems. CoRR (2022)
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) (2022)
Johannes J. Brust, Michael A. Saunders
PLSS: A Projected Linear Systems Solver. CoRR (2022)
Na Huang, Yu-Hong Dai, Dominique Orban, Michael A. Saunders
A semi-conjugate gradient method for solving unsymmetric positive definite linear systems. CoRR (2022)
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. Parallel Comput. 111 (2022)
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 (2021)
Ding Ma, Dominique Orban, Michael A. Saunders
A Julia implementation of Algorithm NCL for constrained optimization. CoRR (2021)
Ali Eshragh, Oliver Di Pietro, Michael A. Saunders
Toeplitz Least Squares Problems, Fast Algorithms and Big Data. CoRR (2021)
Johannes J. Brust, Roummel F. Marcia, Cosmin G. Petra, Michael A. Saunders
Large-scale Optimization with Linear Equality Constraints using Reduced Compact Representation. CoRR (2021)
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 (2021)
Ron Estrin, Michael P. Friedlander, Dominique Orban, Michael A. Saunders
Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization. SIAM J. Sci. Comput. 42 (3) (2020)
Ron Estrin, Michael P. Friedlander, Dominique Orban, Michael A. Saunders
Implementing a Smooth Exact Penalty Function for General Constrained Nonlinear Optimization. SIAM J. Sci. Comput. 42 (3) (2020)
Laurence Yang, Ali Ebrahim, Colton J. Lloyd, Michael A. Saunders, Bernhard O. Palsson
DynamicME: dynamic simulation and refinement of integrated models of metabolism and protein expression. BMC Syst. Biol. 13 (1) (2019)
Ron Estrin, Dominique Orban, Michael A. Saunders
Euclidean-Norm Error Bounds for SYMMLQ and CG. SIAM J. Matrix Anal. Appl. 40 (1) (2019)
Ron Estrin, Michael P. Friedlander, Dominique Orban, Michael A. Saunders
Implementing a smooth exact penalty function for equality-constrained nonlinear optimization. CoRR (2019)
Laurence Yang, Michael A. Saunders, Jean-Christophe Lachance, Bernhard O. Palsson, José Bento
Estimating Cellular Goals from High-Dimensional Biological Data. KDD (2019)
Ron Estrin, Michael P. Friedlander, Dominique Orban, Michael A. Saunders
Implementing a smooth exact penalty function for general constrained nonlinear optimization. CoRR (2019)
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) (2019)
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) (2019)
Drosos Kourounis, Leonidas Gergidis, Michael A. Saunders, Andrea Walther, Olaf Schenk
Compile-Time Symbolic Differentiation Using C++ Expression Templates. CoRR (2017)
Laurence Yang, Ding Ma, Ali Ebrahim, Colton J. Lloyd, Michael A. Saunders, Bernhard O. Palsson
solveME: fast and reliable solution of nonlinear ME models. BMC Bioinform. 17 (2016)
Shai Tejman-Yarden, Ofer Levi, Alex Beizerov, Yisrael Parmet, Tu Nguyen, Michael A. Saunders, Zvia Rudich, James C. Perry, Dewleen G. Baker, Tobias Möller-Bertram
Heart rate analysis by sparse representation for acute pain detection. Medical Biol. Eng. Comput. 54 (4) (2016)
Jiyan Yang, Michael W. Mahoney, Michael A. Saunders, Yuekai Sun
Feature-distributed sparse regression: a screen-and-clean approach. NIPS (2016)
Youngsoo Choi, Charbel Farhat, Walter Murray, Michael A. Saunders
A Practical Factorization of a Schur Complement for PDE-Constrained Distributed Optimal Control. J. Sci. Comput. 65 (2) (2015)
Jason D. Lee, Yuekai Sun, Michael A. Saunders
Proximal Newton-Type Methods for Minimizing Composite Functions. SIAM J. Optim. 24 (3) (2014)
Xiangrui Meng, Michael A. Saunders, Michael W. Mahoney
LSRN: A Parallel Iterative Solver for Strongly Over- or Underdetermined Systems. SIAM J. Sci. Comput. 36 (2) (2014)
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) (2014)
Evrim Acar, Mathias Nilsson, Michael A. Saunders
A flexible modeling framework for coupled matrix and tensor factorizations. EUSIPCO (2014)
Yuekai Sun, Ronan M. T. Fleming, Ines Thiele, Michael A. Saunders
Robust flux balance analysis of multiscale biochemical reaction networks. BMC Bioinform. 14 (2013)
Víctor Pereyra, Michael A. Saunders, José Castillo
Equispaced Pareto front construction for constrained bi-objective optimization. Math. Comput. Model. 57 (9-10) (2013)
Sou-Cheng T. Choi, Michael A. Saunders
ALGORITHM xxx: MINRES-QLP for Singular Symmetric and Hermitian Linear Equations and Least-Squares Problems CoRR (2013)
Jason D. Lee, Yuekai Sun, Michael A. Saunders
Proximal Newton-type methods for convex optimization. NIPS (2012)
Jason D. Lee, Yuekai Sun, Michael A. Saunders
Proximal Newton-type Methods for Minimizing Convex Objective Functions in Composite Form CoRR (2012)
Xiangrui Meng, Michael A. Saunders, Michael W. Mahoney
LSRN: A Parallel Iterative Solver for Strongly Over- or Under-Determined Systems CoRR (2011)
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) (2011)
David Chin-Lung Fong, Michael A. Saunders
LSMR: An Iterative Algorithm for Sparse Least-Squares Problems. SIAM J. Sci. Comput. 33 (5) (2011)
David Chin-Lung Fong, Michael A. Saunders
LSMR: An iterative algorithm for sparse least-squares problems CoRR (2010)
Sou-Cheng T. Choi, Christopher C. Paige, Michael A. Saunders
MINRES-QLP: a Krylov subspace method for indefinite or singular symmetric systems CoRR (2010)
Michael J. O'Sullivan, Michael A. Saunders
Stabilizing Policy Improvement for Large-Scale Infinite-Horizon Dynamic Programming. SIAM J. Matrix Anal. Appl. 31 (2) (2009)
Carl-Magnus Fransson, Torsten Wik, Bengt Lennartson, Michael A. Saunders, Per Olof Gutman
Nonconservative Robust Control: Optimized and Constrained Sensitivity Functions. IEEE Trans. Control. Syst. Technol. 17 (2) (2009)
Philip E. Gill, Walter Murray, Michael A. Saunders, John A. Tomlin, Margaret H. Wright
George B. Dantzig and systems optimization. Discret. Optim. 5 (2) (2008)
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) (2008)
Michael W. Carter, Holly H. Jin, Michael A. Saunders, Yinyu Ye
SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization. SIAM J. Optim. 17 (4) (2006)
Philip E. Gill, Walter Murray, Michael A. Saunders
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization. SIAM Rev. 47 (1) (2005)
Michael P. Friedlander, Michael A. Saunders
A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization. SIAM J. Optim. 15 (3) (2005)
Carl-Magnus Fransson, Michael A. Saunders
A bisection algorithm for the mixed μ upper bound and its supremum. ACC (2004)
Philip E. Gill, Walter Murray, Michael A. Saunders
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization. SIAM J. Optim. 12 (4) (2002)
Scott Shaobing Chen, David L. Donoho, Michael A. Saunders
Atomic Decomposition by Basis Pursuit. SIAM Rev. 43 (1) (2001)
Scott Shaobing Chen, David L. Donoho, Michael A. Saunders
Atomic Decomposition by Basis Pursuit. SIAM J. Sci. Comput. 20 (1) (1998)
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) (1996)
Philip E. Gill, Walter Murray, Dulce B. Ponceleon, Michael A. Saunders
Primal - dual methods for linear programming. Math. Program. 70 (1995)
Florian Jarre, Michael A. Saunders
A Practical Interior-Point Method for Convex Programming. SIAM J. Optim. 5 (1) (1995)
Michael A. Saunders
Commentary - Major Cholesky Would Feel Proud. INFORMS J. Comput. 6 (1) (1994)
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) (1994)
Samuel K. Eldersveld, Michael A. Saunders
A Block-LU Update for Large-Scale Linear Programming. SIAM J. Matrix Anal. Appl. 13 (1) (1992)
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) (1992)
Philip E. Gill, Walter Murray, Michael A. Saunders, Margaret H. Wright
Inertia-Controlling Methods for General Quadratic Programming. SIAM Rev. 33 (1) (1991)
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) (1989)
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) (1986)
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) (1985)
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) (1984)
Philip E. Gill, Nicholas I. M. Gould, Walter Murray, Michael A. Saunders, Margaret H. Wright
A weighted gram-schmidt method for convex quadratic programming. Math. Program. 30 (2) (1984)
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) (1982)
Christopher C. Paige, Michael A. Saunders
Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems. ACM Trans. Math. Softw. 8 (2) (1982)
Christopher C. Paige, Michael A. Saunders
LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares. ACM Trans. Math. Softw. 8 (1) (1982)
Bruce A. Murtagh, Michael A. Saunders
Large-scale linearly constrained optimization. Math. Program. 14 (1) (1978)