| 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 |
| Adaptive, Limited-Memory BFGS Algorithms for Unconstrained Optimization | 1 | 0.35 | 2019 |
| 3D spatially-adaptive canonical correlation analysis: Local and global methods. | 0 | 0.34 | 2018 |
| A family of locally constrained CCA models for detecting activation patterns in fMRI. | 1 | 0.35 | 2017 |
| An inexact successive quadratic approximation method for L-1 regularized optimization. | 6 | 0.47 | 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 |
| 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 |
| 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 |
| On the Use of Stochastic Hessian Information in Optimization Methods for Machine Learning. | 64 | 3.65 | 2011 |
| An active-set algorithm for nonlinear programming using parametric linear programming | 6 | 0.56 | 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 |
| Steering exact penalty methods for nonlinear programming | 26 | 1.08 | 2008 |
| An Inexact SQP Method for Equality Constrained Optimization | 20 | 1.02 | 2008 |
| Domain decomposition methods for PDE constrained optimization problems | 0 | 0.34 | 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 |
| A trust region method based on interior point techniques for nonlinear programming | 232 | 30.78 | 2000 |
| A Global Optimization Strategy for Predicting -helical Protein Tertiary Structure | 2 | 0.39 | 2000 |
| A Hierarchical Approach for Parallelization of a Global Optimization Method for Protein Structure Prediction | 4 | 0.46 | 1999 |
| An Interior Point Algorithm for Large-Scale Nonlinear Programming | 276 | 30.11 | 1999 |
| Algorithm 778: L-BFGS-B: Fortran subroutines for large-scale bound-constrained optimization | 306 | 21.63 | 1997 |
| A Stochastic/Perturbation Global Optimization Algorithm for Distance Geometry Problems | 10 | 1.71 | 1997 |
| Analysis of a Symmetric Rank-One Trust Region Method | 16 | 1.27 | 1996 |
| Global optimization methods for protein folding problems. | 6 | 1.05 | 1995 |
| A limited memory algorithm for bound constrained optimization | 712 | 62.50 | 1995 |
| Representations of quasi-Newton matrices and their use in limited memory methods | 179 | 30.52 | 1994 |
| Parallel Global Optimization Methods for Molecular Configuration Problems | 4 | 0.75 | 1993 |
| Parallel methods for solving nonlinear block bordered systems of equations | 8 | 0.71 | 1992 |
| On the Behavior of Broyden’s Class of Quasi-Newton Methods | 21 | 1.87 | 1992 |
| An analysis of reduced Hessian methods for constrained optimization | 25 | 5.20 | 1991 |
| Approximate solution of the trust region problem by minimization over two-dimensional subspaces. | 66 | 10.76 | 1988 |
| An example of irregular convergence in some constrained optimization methods that use the projected hessian. | 8 | 3.66 | 1985 |
| A Theory and Algorithmic Frame for Switch Level Simulation | 0 | 0.34 | 1984 |
