| On properties of univariate max functions at local maximizers | 0 | 0.34 | 2022 |
| Analysis of the gradient method with an Armijo–Wolfe line search on a class of non-smooth convex functions | 0 | 0.34 | 2020 |
| First-Order Perturbation Theory for Eigenvalues and Eigenvectors | 0 | 0.34 | 2019 |
| Low-Order Control Design Using A Reduced-Order Model With A Stability Constraint On The Full-Order Model | 0 | 0.34 | 2018 |
| Approximating the Real Structured Stability Radius with Frobenius-Norm Bounded Perturbations. | 0 | 0.34 | 2017 |
| Polynomial root radius optimization with affine constraints. | 0 | 0.34 | 2017 |
| Variational analysis of the Crouzeix ratio. | 1 | 0.39 | 2017 |
| A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles | 6 | 0.51 | 2017 |
| An Efficient Algorithm for Computing the Generalized Null Space Decomposition. | 3 | 0.49 | 2015 |
| Nonsmooth optimization via quasi-Newton methods. | 63 | 2.36 | 2013 |
| Fast Approximation of the HINFINITY Norm via Optimization over Spectral Value Sets. | 0 | 0.34 | 2013 |
| Explicit Solutions for Root Optimization of a Polynomial Family With One Affine Constraint. | 3 | 0.78 | 2012 |
| Some Regularity Results for the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix. | 2 | 0.42 | 2012 |
| A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization. | 22 | 0.90 | 2012 |
| Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix | 21 | 3.01 | 2011 |
| Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix | 21 | 3.01 | 2011 |
| Optimizing the asymptotic convergence rate of the Diaconis--Holmes--Neal sampler | 2 | 0.54 | 2007 |
| Large-scale semidefinite programs in electronic structure calculation | 6 | 0.52 | 2007 |
| An Algorithm to Compute Seplambda | 1 | 0.48 | 2006 |
| Stabilization via Nonsmooth, Nonconvex Optimization | 31 | 2.58 | 2006 |
| A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization | 111 | 7.58 | 2005 |
| Survey and Review. | 0 | 0.34 | 2005 |
| Variational analysis of functions of the roots of polynomials | 2 | 0.42 | 2005 |
| Variational Analysis of the Abscissa Mapping for Polynomials via the Gauss-Lucas Theorem | 7 | 1.15 | 2004 |
| Design of Hermite Subdivision Schemes Aided by Spectral Radius Optimization | 7 | 0.68 | 2003 |
| Variational Analysis of the Abscissa Mapping for Polynomials | 6 | 3.12 | 2001 |
| Variational Analysis of Non-Lipschitz Spectral Functions | 25 | 8.42 | 2001 |
| Optimal Stability and Eigenvalue Multiplicity | 15 | 5.24 | 2001 |
| An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms | 25 | 4.35 | 2000 |
| Dedication | 0 | 0.34 | 1999 |
| Conditioning of semidefinite programs | 7 | 0.87 | 1999 |
| Two Heuristics for the Euclidean Steiner Tree Problem | 5 | 0.82 | 1998 |
| Complementarity and nondegeneracy in semidefinite programming | 86 | 12.94 | 1997 |
| Perturbing the critically damped wave equation | 5 | 3.87 | 1996 |
| Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices | 29 | 15.17 | 1995 |
| On the sum of the largest eigenvalues of a symmetric matrix | 41 | 40.00 | 1992 |
| A globally convergent algorithm for minimizing over the rotation group of quadratic forms | 1 | 0.45 | 1989 |
| A quadratically convergent method for minimizing a sum of euclidean norms. | 34 | 14.97 | 1983 |
| A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix | 39 | 446.06 | 1981 |
| Steplength algorithms for minimizing a class of nondifferentiable functions. | 7 | 5.04 | 1979 |
