default search action
Michael L. Overton
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j56]Steffen W. R. Werner
, Michael L. Overton
Multifidelity Robust Controller Design with Gradient Sampling. SIAM J. Sci. Comput. 45(2): 933- (2023) - [i8]Michael L. Overton, Pinze Yu:
On the Choice of Sign Defining Householder Transformations. CoRR abs/2309.02443 (2023) - [i7]Tim Mitchell, Michael L. Overton:
An Experimental Comparison of Methods for Computing the Numerical Radius. CoRR abs/2310.04646 (2023) - 2022
- [j55]Tim Mitchell
On properties of univariate max functions at local maximizers. Optim. Lett. 16(9): 2527-2541 (2022) - [i6]Steffen W. R. Werner
Multi-fidelity robust controller design with gradient sampling. CoRR abs/2205.15050 (2022) - 2021
- [i5]Michael L. Overton:
Local Minimizers of the Crouzeix Ratio: A Nonsmooth Optimization Case Study. CoRR abs/2105.14176 (2021) - 2020
- [j54]Azam Asl
Analysis of the gradient method with an Armijo-Wolfe line search on a class of non-smooth convex functions. Optim. Methods Softw. 35(2): 223-242 (2020) - [j53]Adrian S. Lewis
Partial Smoothness of the Numerical Radius at Matrices Whose Fields of Values are Disks. SIAM J. Matrix Anal. Appl. 41(3): 1004-1032 (2020) - [j52]Anne Greenbaum
First-Order Perturbation Theory for Eigenvalues and Eigenvectors. SIAM Rev. 62(2): 463-482 (2020) - [i4]Suat Gumussoy, Michael L. Overton:
Fixed-Order H-infinity Controller Design via HIFOO, a Specialized Nonsmooth Optimization Package. CoRR abs/2003.02295 (2020) - [i3]Suat Gumussoy, Marc Millstone, Michael L. Overton:
H-infinity Strong Stabilization via HIFOO, a Package for Fixed-Order Controller Design. CoRR abs/2003.03853 (2020) - [i2]Oleg N. Kirillov, Michael L. Overton:
Finding the strongest stable weightless column with a follower load and relocatable concentrated masses. CoRR abs/2008.09551 (2020)
2010 – 2019
- 2019
- [i1]Anne Greenbaum, Ren-Cang Li, Michael L. Overton:
First-order Perturbation Theory for Eigenvalues and Eigenvectors. CoRR abs/1903.00785 (2019) - 2018
- [c5]Peter Benner, Tim Mitchell, Michael L. Overton:
Low-Order Control Design using a Reduced-Order Model with a Stability Constraint on the Full-Order Model. CDC 2018: 3000-3005 - 2017
- [j51]Anne Greenbaum, Adrian S. Lewis, Michael L. Overton:
Variational analysis of the Crouzeix ratio. Math. Program. 164(1-2): 229-243 (2017) - [j50]Julia Eaton, Sara Grundel, Mert Gürbüzbalaban
Polynomial root radius optimization with affine constraints. Math. Program. 165(2): 509-528 (2017) - [j49]Frank E. Curtis
A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles. Optim. Methods Softw. 32(1): 148-181 (2017) - [j48]Nicola Guglielmi, Mert Gürbüzbalaban
Approximating the Real Structured Stability Radius with Frobenius-Norm Bounded Perturbations. SIAM J. Matrix Anal. Appl. 38(4): 1323-1353 (2017) - 2015
- [j47]Immanuel M. Bomze
Narrowing the difficulty gap for the Celis-Dennis-Tapia problem. Math. Program. 151(2): 459-476 (2015) - [j46]Nicola Guglielmi
An Efficient Algorithm for Computing the Generalized Null Space Decomposition. SIAM J. Matrix Anal. Appl. 36(1): 38-54 (2015) - 2014
- [j45]Christoph Helmberg, Michael L. Overton, Franz Rendl
The spectral bundle method with second-order information. Optim. Methods Softw. 29(4): 855-876 (2014) - 2013
- [j44]Antonio Frangioni
Preface. Math. Program. 140(1): 1-3 (2013) - [j43]Adrian S. Lewis
Nonsmooth optimization via quasi-Newton methods. Math. Program. 141(1-2): 135-163 (2013) - [j42]Nicola Guglielmi
Fast Approximation of the HINFINITY Norm via Optimization over Spectral Value Sets. SIAM J. Matrix Anal. Appl. 34(2): 709-737 (2013) - 2012
- [j41]Mert Gürbüzbalaban
Some Regularity Results for the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix. SIAM J. Optim. 22(2): 281-285 (2012) - [j40]Frank E. Curtis
A Sequential Quadratic Programming Algorithm for Nonconvex, Nonsmooth Constrained Optimization. SIAM J. Optim. 22(2): 474-500 (2012) - [j39]Vincent D. Blondel, Mert Gürbüzbalaban
Explicit Solutions for Root Optimization of a Polynomial Family With One Affine Constraint. IEEE Trans. Autom. Control. 57(12): 3078-3089 (2012) - 2011
- [j38]Nicola Guglielmi
Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix. SIAM J. Matrix Anal. Appl. 32(4): 1166-1192 (2011) - 2010
- [c4]Vincent D. Blondel, Mert Gürbüzbalaban
Explicit solutions for root optimization of a polynomial family. CDC 2010: 485-488
2000 – 2009
- 2008
- [c3]Suat Gumussoy
Fixed-order H∞ controller design via HIFOO, a specialized nonsmooth optimization package. ACC 2008: 2750-2754 - [c2]Suat Gumussoy
Hinfinity strong stabilization via HIFOO, a package for fixed-order controller design. CDC 2008: 4135-4140 - 2007
- [j37]Kranthi K. Gade, Michael L. Overton:
Optimizing the asymptotic convergence rate of the Diaconis-Holmes-Neal sampler. Adv. Appl. Math. 38(3): 382-403 (2007) - [j36]Mituhiro Fukuda
Large-scale semidefinite programs in electronic structure calculation. Math. Program. 109(2-3): 553-580 (2007) - [j35]James V. Burke, Adrian S. Lewis, Michael L. Overton:
Spectral conditioning and pseudospectral growth. Numerische Mathematik 107(1): 27-37 (2007) - [j34]James V. Burke, Adrian S. Lewis, Michael L. Overton:
Convexity and Lipschitz Behavior of Small Pseudospectra. SIAM J. Matrix Anal. Appl. 29(2): 586-595 (2007) - 2006
- [j33]Ming Gu, Michael L. Overton:
An Algorithm to Compute Sepλ. SIAM J. Matrix Anal. Appl. 28(2): 348-359 (2006) - [j32]Ming Gu, Emre Mengi
Fast Methods for Estimating the Distance to Uncontrollability. SIAM J. Matrix Anal. Appl. 28(2): 477-502 (2006) - [j31]James V. Burke, Didier Henrion
Stabilization via Nonsmooth, Nonconvex Optimization. IEEE Trans. Autom. Control. 51(11): 1760-1769 (2006) - 2005
- [j30]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) - [j29]James V. Burke, Adrian S. Lewis, Michael L. Overton:
A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization. SIAM J. Optim. 15(3): 751-779 (2005) - [j28]Michael L. Overton:
Survey and Review. SIAM Rev. 47(4): 627 (2005) - [c1]Michael L. Overton, Paul Van Dooren:
On computing the complex passivity radius. CDC/ECC 2005: 7960-7964 - 2004
- [j27]James V. Burke, Adrian S. Lewis, Michael L. Overton:
Variational Analysis of the Abscissa Mapping for Polynomials via the Gauss-Lucas Theorem. J. Glob. Optim. 28(3-4): 259-268 (2004) - [j26]James V. Burke, Adrian S. Lewis, Michael L. Overton:
Pseudospectral Components and the Distance to Uncontrollability. SIAM J. Matrix Anal. Appl. 26(2): 350-361 (2004) - 2003
- [j25]James V. Burke, Adrian S. Lewis, Michael L. Overton:
Optimization and Pseudospectra, with Applications to Robust Stability. SIAM J. Matrix Anal. Appl. 25(1): 80-104 (2003) - [j24]Bin Han, Michael L. Overton, Thomas P. Y. Yu:
Design of Hermite Subdivision Schemes Aided by Spectral Radius Optimization. SIAM J. Sci. Comput. 25(2): 643-656 (2003) - 2002
- [j23]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
- [b2]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, ISBN 978-0-89871-482-1, pp. I-XI, 1-104 - [j22]James V. Burke, Adrian S. Lewis, Michael L. Overton:
Optimal Stability and Eigenvalue Multiplicity. Found. Comput. Math. 1(2): 205-225 (2001) - [j21]James V. Burke, Michael L. Overton:
Variational analysis of non-Lipschitz spectral functions. Math. Program. 90(2): 317-351 (2001) - [j20]James V. Burke, Michael L. Overton:
Variational Analysis of the Abscissa Mapping for Polynomials. SIAM J. Control. Optim. 39(6): 1651-1676 (2001) - 2000
- [j19]Knud D. Andersen, Edmund Christiansen, Andrew R. Conn, Michael L. Overton:
An Efficient Primal-Dual Interior-Point Method for Minimizing a Sum of Euclidean Norms. SIAM J. Sci. Comput. 22(1): 243-262 (2000)
1990 – 1999
- 1999
- [j18]Madhu V. Nayakkankuppam, Michael L. Overton:
Conditioning of semidefinite programs. Math. Program. 85(3): 525-540 (1999) - [j17]Michael L. Overton, Robert B. Schnabel:
Dedication. SIAM J. Optim. 9(4) (1999) - 1998
- [j16]Derek R. Dreyer, Michael L. Overton:
Two Heuristics for the Euclidean Steiner Tree Problem. J. Glob. Optim. 13(1): 95-106 (1998) - [j15]Farid Alizadeh, Jean-Pierre A. Haeberly, Michael L. Overton:
Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results. SIAM J. Optim. 8(3): 746-768 (1998) - [j14]Knud D. Andersen, Edmund Christiansen, Michael L. Overton:
Computing Limit Loads by Minimizing a Sum of Norms. SIAM J. Sci. Comput. 19(3): 1046-1062 (1998) - 1997
- [j13]Michael L. Overton, Henry Wolkowicz:
Semidefinite Programming. Math. Program. 77: 105-109 (1997) - [j12]Farid Alizadeh, Jean-Pierre A. Haeberly, Michael L. Overton:
Complementarity and nondegeneracy in semidefinite programming. Math. Program. 77: 111-128 (1997) - [j11]Julio Moro
On the Lidskii-Vishik-Lyusternik Perturbation Theory for Eigenvalues of Matrices with Arbitrary Jordan Structure. SIAM J. Matrix Anal. Appl. 18(4): 793-817 (1997) - 1996
- [j10]Steven J. Cox, Michael L. Overton:
Perturbing the Critically Damped Wave Equation. SIAM J. Appl. Math. 56(5): 1353-1362 (1996) - 1995
- [j9]Michael L. Overton, Robert S. Womersley:
Second Derivatives for Optimizing Eigenvalues of Symmetric Matrices. SIAM J. Matrix Anal. Appl. 16(3): 697-718 (1995) - 1994
- [j8]Jean-Pierre A. Haeberly, Michael L. Overton:
A Hybrid Algorithm for Optimizing Eigenvalues of Symmetric Definite Pencils. SIAM J. Matrix Anal. Appl. 15(4): 1141-1156 (1994) - 1993
- [j7]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) - 1992
- [j6]Michael L. Overton:
Large-Scale Optimization of Eigenvalues. SIAM J. Optim. 2(1): 88-120 (1992) - [j5]Michael L. Overton, Robert S. Womersley:
On the Sum of the Largest Eigenvalues of a Symmetric Matrix. SIAM J. Matrix Anal. Appl. 13(1): 41-45 (1992)
1980 – 1989
- 1989
- [j4]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) - 1983
- [j3]Michael L. Overton:
A quadratically convergent method for minimizing a sum of euclidean norms. Math. Program. 27(1): 34-63 (1983) - 1981
- [j2]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)
1970 – 1979
- 1979
- [b1]Michael L. Overton:
Projected Lagrangian algorithms for nonlinear minimax and l₁ optimization. Stanford University, USA, 1979 - [j1]Walter Murray, Michael L. Overton:
Steplength algorithms for minimizing a class of nondifferentiable functions. Computing 23(4): 309-331 (1979)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: