| A NOISE-TOLERANT QUASI-NEWTON ALGORITHM FOR UNCONSTRAINED OPTIMIZATION | 0 | 0.34 | 2022 |
| Analysis of the BFGS Method with Errors | 0 | 0.34 | 2020 |
| Derivative-Free Optimization of Noisy Functions via Quasi-Newton Methods | 3 | 0.46 | 2019 |
| Optimization Methods for Large-Scale Machine Learning. | 236 | 8.68 | 2018 |
| On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minima. | 172 | 5.89 | 2017 |
| An investigation of Newton-Sketch and subsampled Newton methods | 4 | 0.38 | 2017 |
| A Multi-Batch L-BFGS Method for Machine Learning. | 12 | 0.56 | 2016 |
| An inexact successive quadratic approximation method for L-1 regularized optimization. | 6 | 0.47 | 2016 |
| A second-order method for convex l1-regularized optimization with active-set prediction. | 0 | 0.34 | 2016 |
| A Multi-Batch L-BFGS Method for Machine Learning. | 0 | 0.34 | 2016 |
| A family of second-order methods for convex ℓ1-regularized optimization. | 0 | 0.34 | 2016 |
| An algorithm for quadratic ℓ1-regularized optimization with a flexible active-set strategy. | 6 | 0.48 | 2015 |
| An interior point method for nonlinear programming with infeasibility detection capabilities | 4 | 0.40 | 2014 |
| A Stochastic Quasi-Newton Method for Large-Scale Optimization | 76 | 3.42 | 2014 |
| On the use of piecewise linear models in nonlinear programming. | 1 | 0.37 | 2013 |
| Subspace Accelerated Matrix Splitting Algorithms for Asymmetric and Symmetric Linear Complementarity Problems. | 6 | 0.50 | 2013 |
| Sample size selection in optimization methods for machine learning | 30 | 2.08 | 2012 |
| A line search exact penalty method using steering rules | 18 | 0.77 | 2012 |
| Remark on “algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound constrained optimization” | 51 | 2.05 | 2011 |
| On the Use of Stochastic Hessian Information in Optimization Methods for Machine Learning. | 64 | 3.65 | 2011 |
| On the solution of complementarity problems arising in American options pricing | 8 | 0.99 | 2011 |
| An inexact Newton method for nonconvex equality constrained optimization | 16 | 0.77 | 2010 |
| Infeasibility Detection and SQP Methods for Nonlinear Optimization | 22 | 1.03 | 2010 |
| On the geometry phase in model-based algorithms for derivative-free optimization | 19 | 1.22 | 2009 |
| A Matrix-Free Algorithm for Equality Constrained Optimization Problems with Rank-Deficient Jacobians | 14 | 0.67 | 2009 |
| Fast and parallel algorithms for pricing American options: keynote | 0 | 0.34 | 2009 |
| Adaptive Barrier Update Strategies for Nonlinear Interior Methods | 21 | 0.85 | 2009 |
| Steering exact penalty methods for nonlinear programming | 26 | 1.08 | 2008 |
| An Inexact SQP Method for Equality Constrained Optimization | 20 | 1.02 | 2008 |
| An algorithm for the fast solution of symmetric linear complementarity problems | 6 | 1.01 | 2008 |
| Steplength selection in interior-point methods for quadratic programming | 1 | 0.40 | 2007 |
| A Numerical Study of Active-Set and Interior-Point Methods for Bound Constrained Optimization. | 3 | 0.47 | 2006 |
| Interior Methods for Mathematical Programs with Complementarity Constraints | 53 | 2.56 | 2006 |
| A starting point strategy for nonlinear interior methods | 7 | 0.57 | 2004 |
| On the convergence of Newton iterations to non-stationary points | 20 | 2.01 | 2004 |
| An algorithm for nonlinear optimization using linear programming and equality constrained subproblems | 30 | 1.38 | 2004 |
| Feasible Interior Methods Using Slacks for Nonlinear Optimization | 13 | 1.70 | 2003 |
| Solving Optimization Problems Using Parallel and Grid Computing | 0 | 0.34 | 2003 |
| On the Behavior of the Gradient Norm in the Steepest Descent Method | 23 | 2.55 | 2002 |
| Enriched Methods for Large-Scale Unconstrained Optimization | 15 | 1.27 | 2002 |
| Wedge trust region methods for derivative free optimization | 31 | 3.67 | 2002 |
| Algorithm 809: PREQN: Fortran 77 subroutines for preconditioning the conjugate gradient method | 7 | 0.63 | 2001 |
| On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization | 86 | 6.52 | 2001 |
| Numerical Experience with a Reduced Hessian Method for Large Scale Constrained Optimization | 11 | 1.08 | 2000 |
| Automatic Preconditioning by Limited Memory Quasi-Newton Updating | 53 | 4.26 | 2000 |
| A trust region method based on interior point techniques for nonlinear programming | 232 | 30.78 | 2000 |
| An Interior Point Algorithm for Large-Scale Nonlinear Programming | 276 | 30.11 | 1999 |
| On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization | 29 | 7.74 | 1998 |
| Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization | 306 | 21.63 | 1997 |
| A limited memory algorithm for bound constrained optimization | 712 | 62.50 | 1995 |
