 | 2012 |
| 19 |  | Mert Gürbüzbalaban,
Michael L. Overton:
Some Regularity Results for the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix.
SIAM Journal on Optimization 22(2): 281-285 (2012) |
| 2011 |
| 18 |  | Nicola Guglielmi,
Michael L. Overton:
Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix.
SIAM J. Matrix Analysis Applications 32(4): 1166-1192 (2011) |
| 2010 |
| 17 |  | Vincent D. Blondel,
Mert Gürbüzbalaban,
Alexandre Megretski,
Michael L. Overton:
Explicit solutions for root optimization of a polynomial family.
CDC 2010: 485-488 |
| 2008 |
| 16 |  | Suat Gumussoy,
Marc Millstone,
Michael L. Overton:
Hinfinity strong stabilization via HIFOO, a package for fixed-order controller design.
CDC 2008: 4135-4140 |
| 2007 |
| 15 |  | Mituhiro Fukuda,
Bastiaan J. Braams,
Maho Nakata,
Michael L. Overton,
Jerome K. Percus,
Makoto Yamashita,
Zhengji Zhao:
Large-scale semidefinite programs in electronic structure calculation.
Math. Program. 109(2-3): 553-580 (2007) |
| 14 |  | James V. Burke,
Adrian S. Lewis,
Michael L. Overton:
Convexity and Lipschitz Behavior of Small Pseudospectra.
SIAM J. Matrix Analysis Applications 29(2): 586-595 (2007) |
| 2006 |
| 13 |  | Ming Gu,
Michael L. Overton:
An Algorithm to Compute Sepλ.
SIAM J. Matrix Analysis Applications 28(2): 348-359 (2006) |
| 2005 |
| 12 |  | James V. Burke,
Adrian S. Lewis,
Michael L. Overton:
Variational analysis of functions of the roots of polynomials.
Math. Program. 104(2-3): 263-292 (2005) |
| 11 |  | James V. Burke,
Adrian S. Lewis,
Michael L. Overton:
A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization.
SIAM Journal on Optimization 15(3): 751-779 (2005) |
| 2004 |
| 10 |  | James V. Burke,
Adrian S. Lewis,
Michael L. Overton:
Pseudospectral Components and the Distance to Uncontrollability.
SIAM J. Matrix Analysis Applications 26(2): 350-361 (2004) |
| 2003 |
| 9 |  | James V. Burke,
Adrian S. Lewis,
Michael L. Overton:
Optimization and Pseudospectra, with Applications to Robust Stability.
SIAM J. Matrix Analysis Applications 25(1): 80-104 (2003) |
| 2002 |
| 8 |  | James V. Burke,
Adrian S. Lewis,
Michael L. Overton:
Approximating Subdifferentials by Random Sampling of Gradients.
Math. Oper. Res. 27(3): 567-584 (2002) |
| 2001 |
| 7 |  | Michael L. Overton:
Numerical computing with IEEE floating point arithmetic - including one theorem, one rule of thumb, and one hundred and one exercices.
SIAM 2001: I-XI, 1-104 |
| 6 |  | James V. Burke,
Michael L. Overton:
Variational Analysis of the Abscissa Mapping for Polynomials.
SIAM J. Control and Optimization 39(6): 1651-1676 (2001) |
| 1997 |
| 5 |  | Michael L. Overton,
Henry Wolkowicz:
Semidefinite Programming.
Math. Program. 77: 105-109 (1997) |
| 4 |  | Farid Alizadeh,
Jean-Pierre A. Haeberly,
Michael L. Overton:
Complementarity and nondegeneracy in semidefinite programming.
Math. Program. 77: 111-128 (1997) |
| 1993 |
| 3 |  | Michael L. Overton,
Robert S. Womersley:
Optimality conditions and duality theory for minimizing sums of the largest eigenvalues of symmetric matrices.
Math. Program. 62: 321-357 (1993) |
| 1989 |
| 2 |  | Chaya Gurwitz,
Michael L. Overton:
A Globally Convergent Algorithm for Minimizing Over the Rotation Group of Quadratic Forms.
IEEE Trans. Pattern Anal. Mach. Intell. 11(11): 1228-1232 (1989) |
| 1981 |
| 1 |  | Gene H. Golub,
Franklin T. Luk,
Michael L. Overton:
A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix.
ACM Trans. Math. Softw. 7(2): 149-169 (1981) |