A robust gradient sampling algorithm for nonsmooth, nonconvex optimization JV Burke, AS Lewis, ML Overton SIAM Journal on Optimization 15 (3), 751-779, 2005 | 566 | 2005 |
Weak sharp minima in mathematical programming JV Burke, MC Ferris SIAM Journal on Control and Optimization 31 (5), 1340-1359, 1993 | 455 | 1993 |
HIFOO-a MATLAB package for fixed-order controller design and H∞ optimization JV Burke, D Henrion, AS Lewis, ML Overton IFAC Proceedings Volumes 39 (9), 339-344, 2006 | 357 | 2006 |
An exact penalization viewpoint of constrained optimization JV Burke SIAM Journal on control and optimization 29 (4), 968-998, 1991 | 302 | 1991 |
On the identification of active constraints JV Burke, JJ Moré SIAM Journal on Numerical Analysis 25 (5), 1197-1211, 1988 | 288 | 1988 |
Optical wavefront reconstruction: Theory and numerical methods DR Luke, JV Burke, RG Lyon SIAM review 44 (2), 169-224, 2002 | 230 | 2002 |
On the Lidskii--Vishik--Lyusternik perturbation theory for eigenvalues of matrices with arbitrary Jordan structure J Moro, JV Burke, ML Overton SIAM Journal on Matrix Analysis and Applications 18 (4), 793-817, 1997 | 203 | 1997 |
Stabilization via nonsmooth, nonconvex optimization JV Burke, D Henrion, AS Lewis, ML Overton IEEE Transactions on Automatic Control 51 (11), 1760-1769, 2006 | 199 | 2006 |
Calmness and exact penalization JV Burke SIAM Journal on control and optimization 29 (2), 493-497, 1991 | 183 | 1991 |
A robust sequential quadratic programming method JV Burke, SP Han Mathematical Programming 43 (1), 277-303, 1989 | 182 | 1989 |
A Gauss—Newton method for convex composite optimization JV Burke, MC Ferris Mathematical Programming 71 (2), 179-194, 1995 | 176 | 1995 |
The global linear convergence of a noninterior path-following algorithm for linear complementarity problems JV Burke, S Xu Mathematics of Operations Research 23 (3), 719-734, 1998 | 167 | 1998 |
Weak sharp minima revisited Part I: basic theory J Burke, S Deng Control and Cybernetics 31, 439-469, 2002 | 153 | 2002 |
Descent methods for composite nondifferentiable optimization problems JV Burke Mathematical Programming 33, 260-279, 1985 | 152 | 1985 |
Approximating subdifferentials by random sampling of gradients JV Burke, AS Lewis, ML Overton Mathematics of Operations Research 27 (3), 567-584, 2002 | 145 | 2002 |
A non–interior predictor–corrector path following algorithm for the monotone linear complementarity problem J Burke, S Xu Mathematical Programming 87, 113-130, 2000 | 130 | 2000 |
Characterization of solution sets of convex programs JV Burke, MC Ferris Operations Research Letters 10 (1), 57-60, 1991 | 125 | 1991 |
Generalized Kalman smoothing: Modeling and algorithms A Aravkin, JV Burke, L Ljung, A Lozano, G Pillonetto Automatica 86, 63-86, 2017 | 120 | 2017 |
Convergence properties of trust region methods for linear and convex constraints JV Burke, JJ Moré, G Toraldo Mathematical Programming 47 (1), 305-336, 1990 | 116 | 1990 |
Two numerical methods for optimizing matrix stability JV Burke, AS Lewis, ML Overton Linear Algebra and its Applications 351, 117-145, 2002 | 114 | 2002 |