Michael A. Saunders

Orcid: 0000-0003-3800-4982

Affiliations:
  • Stanford University, Department of Management Science and Engineering, USA


According to our database1, Michael A. Saunders authored at least 65 papers between 1972 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Iterative Methods in GPU-Resident Linear Solvers for Nonlinear Constrained Optimization.
CoRR, 2024

2023
On GSOR, the Generalized Successive Overrelaxation Method for Double Saddle-Point Problems.
SIAM J. Sci. Comput., October, 2023

Properties of semi-conjugate gradient methods for solving unsymmetric positive definite linear systems.
Optim. Methods Softw., September, 2023

PLSS: A Projected Linear Systems Solver.
SIAM J. Sci. Comput., April, 2023

HyKKT: a hybrid direct-iterative method for solving KKT linear systems.
Optim. Methods Softw., March, 2023

MinAres: An Iterative Solver for Symmetric Linear Systems.
CoRR, 2023

2022
Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation.
SIAM J. Sci. Comput., 2022

Linear solvers for power grid optimization problems: A review of GPU-accelerated linear solvers.
Parallel Comput., 2022

Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number.
Optim. Methods Softw., 2022

A semi-conjugate gradient method for solving unsymmetric positive definite linear systems.
CoRR, 2022

2021
Toeplitz Least Squares Problems, Fast Algorithms and Big Data.
CoRR, 2021

A Hybrid Direct-Iterative Method for Solving KKT Linear Systems.
CoRR, 2021

A Julia implementation of Algorithm NCL for constrained optimization.
CoRR, 2021

2020
Implementing a Smooth Exact Penalty Function for General Constrained Nonlinear Optimization.
SIAM J. Sci. Comput., 2020

Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization.
SIAM J. Sci. Comput., 2020

2019
LNLQ: An Iterative Method for Least-Norm Problems with an Error Minimization Property.
SIAM J. Matrix Anal. Appl., 2019

LSLQ: An Iterative Method for Linear Least-Squares with an Error Minimization Property.
SIAM J. Matrix Anal. Appl., 2019

Euclidean-Norm Error Bounds for SYMMLQ and CG.
SIAM J. Matrix Anal. Appl., 2019

DynamicME: dynamic simulation and refinement of integrated models of metabolism and protein expression.
BMC Syst. Biol., 2019

Estimating Cellular Goals from High-Dimensional Biological Data.
Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019

2017
Compile-Time Symbolic Differentiation Using C++ Expression Templates.
CoRR, 2017

2016
Heart rate analysis by sparse representation for acute pain detection.
Medical Biol. Eng. Comput., 2016

solveME: fast and reliable solution of nonlinear ME models.
BMC Bioinform., 2016

Feature-distributed sparse regression: a screen-and-clean approach.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

2015
A Practical Factorization of a Schur Complement for PDE-Constrained Distributed Optimal Control.
J. Sci. Comput., 2015

2014
Algorithm 937: MINRES-QLP for symmetric and Hermitian linear equations and least-squares problems.
ACM Trans. Math. Softw., 2014

LSRN: A Parallel Iterative Solver for Strongly Over- or Underdetermined Systems.
SIAM J. Sci. Comput., 2014

Proximal Newton-Type Methods for Minimizing Composite Functions.
SIAM J. Optim., 2014

A flexible modeling framework for coupled matrix and tensor factorizations.
Proceedings of the 22nd European Signal Processing Conference, 2014

2013
Equispaced Pareto front construction for constrained bi-objective optimization.
Math. Comput. Model., 2013

ALGORITHM xxx: MINRES-QLP for Singular Symmetric and Hermitian Linear Equations and Least-Squares Problems
CoRR, 2013

Robust flux balance analysis of multiscale biochemical reaction networks.
BMC Bioinform., 2013

2012
Proximal Newton-type Methods for Minimizing Convex Objective Functions in Composite Form
CoRR, 2012

Proximal Newton-type methods for convex optimization.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

2011
LSMR: An Iterative Algorithm for Sparse Least-Squares Problems.
SIAM J. Sci. Comput., 2011

MINRES-QLP: A Krylov Subspace Method for Indefinite or Singular Symmetric Systems.
SIAM J. Sci. Comput., 2011

LSRN: A Parallel Iterative Solver for Strongly Over- or Under-Determined Systems
CoRR, 2011

2009
Nonconservative Robust Control: Optimized and Constrained Sensitivity Functions.
IEEE Trans. Control. Syst. Technol., 2009

Stabilizing Policy Improvement for Large-Scale Infinite-Horizon Dynamic Programming.
SIAM J. Matrix Anal. Appl., 2009

2008
Variational Bayesian Image Restoration Based on a Product of t-Distributions Image Prior.
IEEE Trans. Image Process., 2008

George B. Dantzig and systems optimization.
Discret. Optim., 2008

2007
Methods for modifying matrix factorizations.
Proceedings of the Milestones in Matrix Computation, 2007

2006
SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization.
SIAM J. Optim., 2006

2005
A Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization.
SIAM J. Optim., 2005

2004
A bisection algorithm for the mixed μ upper bound and its supremum.
Proceedings of the 2004 American Control Conference, 2004

2002
SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization.
SIAM J. Optim., 2002

1998
Atomic Decomposition by Basis Pursuit.
SIAM J. Sci. Comput., 1998

1996
On the Stability of Cholesky Factorization for Symmetric Quasidefinite Systems.
SIAM J. Matrix Anal. Appl., 1996

1995
A Practical Interior-Point Method for Convex Programming.
SIAM J. Optim., 1995

Primal - dual methods for linear programming.
Math. Program., 1995

1994
The simplex algorithm with a new primal and dual pivot rule.
Oper. Res. Lett., 1994

Commentary - Major Cholesky Would Feel Proud.
INFORMS J. Comput., 1994

1992
Preconditioners for Indefinite Systems Arising in Optimization.
SIAM J. Matrix Anal. Appl., 1992

A Block-LU Update for Large-Scale Linear Programming.
SIAM J. Matrix Anal. Appl., 1992

1991
Inertia-Controlling Methods for General Quadratic Programming.
SIAM Rev., 1991

1989
A practical anti-cycling procedure for linearly constrained optimization.
Math. Program., 1989

1986
On projected newton barrier methods for linear programming and an equivalence to Karmarkar's projective method.
Math. Program., 1986

1985
Properties of a representation of a basis for the null space.
Math. Program., 1985

1984
Procedures for optimization problems with a mixture of bounds and general linear constraints.
ACM Trans. Math. Softw., 1984

A weighted gram-schmidt method for convex quadratic programming.
Math. Program., 1984

1982
Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems.
ACM Trans. Math. Softw., 1982

LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares.
ACM Trans. Math. Softw., 1982

A note on a sufficient-decrease criterion for a non-derivative step-length procedure.
Math. Program., 1982

1978
Large-scale linearly constrained optimization.
Math. Program., 1978

1972
Large-scale linear programming using the Cholesky factorization.
PhD thesis, 1972


  Loading...