Michael A. Saunders
Stanford University · 192 works · 36,809 citations · h-index 53
Top works
- Atomic Decomposition by Basis Pursuit
- Atomic Decomposition by Basis Pursuit
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- Solution of Sparse Indefinite Systems of Linear Equations
- Large-scale linearly constrained optimization
- Methods for Modifying Matrix Factorizations
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Sparsity and Smoothness Via the Fused Lasso
- Algorithm 583: LSQR: Sparse Linear Equations and Least Squares Problems
- A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
- MINOS 5.0 User's Guide.
- User's Guide for NPSOL (Version 4.0): A Fortran Package for Nonlinear Programming.
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Towards a Generalized Singular Value Decomposition
- Solving Reduced KKT Systems in Barrier Methods for Linear and Quadratic Programming
- User's Guide for SOL/NPSOL: A Fortran Package for Nonlinear Programming.
- Numerical Techniques in Mathematical Programming
- Commentary—Major Cholesky Would Feel Proud
- Large-scale linear programming using the Cholesky factorization.