| A SUBSPACE ACCELERATION METHOD FOR MINIMIZATION INVOLVING A GROUP SPARSITY-INDUCING REGULARIZER | 0 | 0.34 | 2022 |
| Limited-memory BFGS with displacement aggregation | 0 | 0.34 | 2022 |
| Trust-Region Newton-Cg With Strong Second-Order Complexity Guarantees For Nonconvex Optimization | 0 | 0.34 | 2021 |
| Sequential Quadratic Optimization For Nonlinear Equality Constrained Stochastic Optimization | 1 | 0.36 | 2021 |
| ADMM for multiaffine constrained optimization | 2 | 0.37 | 2020 |
| Adaptive Stochastic Optimization: A Framework for Analyzing Stochastic Optimization Algorithms | 0 | 0.34 | 2020 |
| Exploiting negative curvature in deterministic and stochastic optimization | 3 | 0.39 | 2019 |
| A Sequential Algorithm for Solving Nonlinear Optimization Problems with Chance Constraints. | 5 | 0.40 | 2018 |
| Complexity Analysis of a Trust Funnel Algorithm for Equality Constrained Optimization. | 1 | 0.35 | 2018 |
| Optimization Methods for Large-Scale Machine Learning. | 236 | 8.68 | 2018 |
| FaRSA for ℓ1-regularized convex optimization: local convergence and numerical experience. | 0 | 0.34 | 2018 |
| Concise complexity analyses for trust region methods. | 0 | 0.34 | 2018 |
| A trust region algorithm with a worst-case iteration complexity of O(ϵ -3/2) for nonconvex optimization. | 0 | 0.34 | 2017 |
| An interior-point trust-funnel algorithm for nonlinear optimization | 1 | 0.35 | 2017 |
| Optimization Methods for Supervised Machine Learning: From Linear Models to Deep Learning. | 3 | 0.40 | 2017 |
| A Reduced-Space Algorithm for Minimizing ℓ1-Regularized Convex Functions. | 0 | 0.34 | 2017 |
| An Accelerated Communication-Efficient Primal-Dual Optimization Framework For Structured Machine Learning | 1 | 0.37 | 2017 |
| Solving nearly-separable quadratic optimization problems as nonsmooth equations. | 1 | 0.37 | 2017 |
| A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles | 6 | 0.51 | 2017 |
| A Self-Correcting Variable-Metric Algorithm for Stochastic Optimization. | 5 | 0.43 | 2016 |
| Adaptive augmented Lagrangian methods: algorithms and practical numerical experience | 2 | 0.36 | 2016 |
| Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves. | 0 | 0.34 | 2016 |
| A quasi-Newton algorithm for nonconvex, nonsmooth optimization with global convergence guarantees | 4 | 0.39 | 2015 |
| Primal-Dual Active-Set Methods for Isotonic Regression and Trend Filtering | 0 | 0.34 | 2015 |
| A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization | 12 | 0.61 | 2015 |
| An adaptive augmented Lagrangian method for large-scale constrained optimization. | 14 | 0.60 | 2015 |
| An Inexact Sequential Quadratic Optimization Algorithm for Nonlinear Optimization. | 5 | 0.42 | 2014 |
| An adaptive gradient sampling algorithm for non-smooth optimization | 9 | 0.52 | 2013 |
| A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization. | 22 | 0.90 | 2012 |
| A penalty-interior-point algorithm for nonlinear constrained optimization. | 4 | 0.40 | 2012 |
| A note on the implementation of an interior-point algorithm for nonlinear optimization with inexact step computations. | 4 | 0.45 | 2012 |
| 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 |
| An Interior-Point Algorithm for Large-Scale Nonlinear Optimization with Inexact Step Computations | 17 | 0.75 | 2010 |
| A Matrix-Free Algorithm for Equality Constrained Optimization Problems with Rank-Deficient Jacobians | 14 | 0.67 | 2009 |
| An Inexact SQP Method for Equality Constrained Optimization | 20 | 1.02 | 2008 |
| Central groupoids, central digraphs, and zero-one matrices A satisfying A 2 = J | 2 | 0.43 | 2004 |
