default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAdrian S. Lewis
Person information
- affiliation: School of Operations Research and Information Engineering, Cornell University, Ithaca, NY, USA
- affiliation: Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j71]Ariel Goodwin, Adrian S. Lewis
, Genaro López-Acedo, Adriana Nicolae:
Convex optimization on CAT(0) cubical complexes. Adv. Appl. Math. 165: 102849 (2025)- 2024
- [j70]Siyu Kong, Adrian S. Lewis:
The Cost of Nonconvexity in Deterministic Nonsmooth Optimization. Math. Oper. Res. 49(4): 2385-2401 (2024) - [j69]Adrian S. Lewis, Genaro López-Acedo, Adriana Nicolae:
Basic Convex Analysis in Metric Spaces with Bounded Curvature. SIAM J. Optim. 34(1): 366-388 (2024) - [i9]Adrian S. Lewis, Genaro López-Acedo, Adriana Nicolae:
Horoballs and the subgradient method. CoRR abs/2403.15749 (2024) - [i8]Siyu Kong, Adrian S. Lewis:
Lipschitz minimization and the Goldstein modulus. CoRR abs/2405.12655 (2024) - [i7]Ariel Goodwin, Adrian S. Lewis, Genaro López-Acedo, Adriana Nicolae:
Recognizing weighted means in geodesic spaces. CoRR abs/2406.03913 (2024) - [i6]Ariel Goodwin, Adrian S. Lewis, Genaro López-Acedo, Adriana Nicolae:
A subgradient splitting algorithm for optimization on nonpositively curved metric spaces. CoRR abs/2412.06730 (2024) - 2023
- [j68]X. Y. Han, Adrian S. Lewis:
Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization. SIAM J. Optim. 33(1): 36-62 (2023) - [i5]Adrian S. Lewis, Tonghua Tian:
The complexity of first-order optimization methods from a metric perspective. CoRR abs/2305.03208 (2023) - 2022
- [j67]Adrian S. Lewis, Jingwei Liang, Tonghua Tian:
Partial Smoothness and Constant Rank. SIAM J. Optim. 32(1): 276-291 (2022) - [j66]Adrian S. Lewis, Genaro López-Acedo, Adriana Nicolae:
Local Linear Convergence of Alternating Projections in Metric Spaces with Bounded Curvature. SIAM J. Optim. 32(2): 1094-1119 (2022) - 2021
- [j65]Adrian S. Lewis, Calvin J. S. Wylie:
Active-Set Newton Methods and Partial Smoothness. Math. Oper. Res. 46(2): 712-725 (2021) - [j64]Dmitriy Drusvyatskiy, Alexander D. Ioffe, Adrian S. Lewis:
Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria. Math. Program. 185(1-2): 357-383 (2021) - [j63]Adrian S. Lewis, Tonghua Tian:
The Structure of Conservative Gradient Fields. SIAM J. Optim. 31(3): 2080-2083 (2021) - [i4]Adrian S. Lewis, Tonghua Tian:
The structure of conservative gradient fields. CoRR abs/2101.00699 (2021) - [i3]X. Y. Han, Adrian S. Lewis:
Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization. CoRR abs/2111.15645 (2021) - 2020
- [j62]Adrian S. Lewis, Michael L. Overton:
Partial Smoothness of the Numerical Radius at Matrices Whose Fields of Values are Disks. SIAM J. Matrix Anal. Appl. 41(3): 1004-1032 (2020)
2010 – 2019
- 2019
- [i2]Adrian S. Lewis, Calvin J. S. Wylie:
A simple Newton method for local nonsmooth optimization. CoRR abs/1907.11742 (2019) - 2018
- [j61]Dmitriy Drusvyatskiy, Adrian S. Lewis:
Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods. Math. Oper. Res. 43(3): 919-948 (2018) - [j60]Jiayi Guo, Adrian S. Lewis:
Nonsmooth Variants of Powell's BFGS Convergence Theorem. SIAM J. Optim. 28(2): 1301-1311 (2018) - 2017
- [j59]Anne Greenbaum, Adrian S. Lewis, Michael L. Overton:
Variational analysis of the Crouzeix ratio. Math. Program. 164(1-2): 229-243 (2017) - 2016
- [j58]Adrian S. Lewis, Stephen J. Wright:
A proximal method for composite minimization. Math. Program. 158(1-2): 501-546 (2016) - [j57]Dmitriy Drusvyatskiy, Alexander D. Ioffe, Adrian S. Lewis:
Generic Minimizing Behavior in Semialgebraic Optimization. SIAM J. Optim. 26(1): 513-534 (2016) - 2015
- [j56]Dmitriy Drusvyatskiy, Alexander D. Ioffe, Adrian S. Lewis:
Transversality and Alternating Projections for Nonconvex Sets. Found. Comput. Math. 15(6): 1637-1651 (2015) - [j55]Adrian S. Lewis, Shuwei Zhang:
Nonsmoothness and a Variable Metric Method. J. Optim. Theory Appl. 165(1): 151-171 (2015) - [j54]Dmitriy Drusvyatskiy, Alexander D. Ioffe, Adrian S. Lewis:
Clarke Subgradients for Directionally Lipschitzian Stratifiable Functions. Math. Oper. Res. 40(2): 328-349 (2015) - [j53]Dmitriy Drusvyatskiy, Alexander D. Ioffe, Adrian S. Lewis:
Curves of Descent. SIAM J. Control. Optim. 53(1): 114-138 (2015) - 2014
- [j52]Dmitriy Drusvyatskiy, Adrian S. Lewis:
Optimality, identifiability, and sensitivity. Math. Program. 147(1-2): 467-498 (2014) - [j51]Aris Daniilidis, Dmitriy Drusvyatskiy, Adrian S. Lewis:
Orthogonal Invariance and Identifiability. SIAM J. Matrix Anal. Appl. 35(2): 580-598 (2014) - 2013
- [j50]Dmitriy Drusvyatskiy, Adrian S. Lewis:
Semi-algebraic functions have small subdifferentials. Math. Program. 140(1): 5-29 (2013) - [j49]Adrian S. Lewis, Michael L. Overton:
Nonsmooth optimization via quasi-Newton methods. Math. Program. 141(1-2): 135-163 (2013) - [j48]Adrian S. Lewis, Shanshan Zhang:
Partial Smoothness, Tilt Stability, and Generalized Hessians. SIAM J. Optim. 23(1): 74-94 (2013) - [j47]Dmitriy Drusvyatskiy, Adrian S. Lewis:
Tilt Stability, Uniform Quadratic Growth, and Strong Metric Regularity of the Subdifferential. SIAM J. Optim. 23(1): 256-267 (2013) - 2011
- [j46]Jérôme Bolte, Aris Daniilidis, Adrian S. Lewis:
Generic Optimality Conditions for Semialgebraic Convex Programs. Math. Oper. Res. 36(1): 55-70 (2011) - [j45]Adrian S. Lewis, Stephen J. Wright:
Identifying Activity. SIAM J. Optim. 21(2): 597-614 (2011) - 2010
- [j44]D. Leventhal, Adrian S. Lewis:
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning. Math. Oper. Res. 35(3): 641-654 (2010)
2000 – 2009
- 2009
- [j43]Adrian S. Lewis, D. Russell Luke, Jérôme Malick:
Local Linear Convergence for Alternating and Averaged Nonconvex Projections. Found. Comput. Math. 9(4): 485-513 (2009) - [j42]Jérôme Bolte, Aris Daniilidis, Adrian S. Lewis:
Tame functions are semismooth. Math. Program. 117(1-2): 5-19 (2009) - [j41]Adrian S. Lewis, Chin How Jeffrey Pang:
Lipschitz Behavior of the Robust Regularization. SIAM J. Control. Optim. 48(5): 3080-3104 (2009) - 2008
- [j40]Adrian S. Lewis, Jérôme Malick:
Alternating Projections on Manifolds. Math. Oper. Res. 33(1): 216-234 (2008) - [j39]Adrian S. Lewis, Chin How Jeffrey Pang:
Variational Analysis of Pseudospectra. SIAM J. Optim. 19(3): 1048-1072 (2008) - [i1]D. Leventhal, Adrian S. Lewis:
Randomized Methods for Linear Constraints: Convergence Rates and Conditioning. CoRR abs/0806.3015 (2008) - 2007
- [j38]Warren L. Hare, Adrian S. Lewis:
Identifying Active Manifolds. Algorithmic Oper. Res. 2(2): 75-82 (2007) - [j37]Adrian S. Lewis:
Nonsmooth optimization and robust control. Annu. Rev. Control. 31(2): 167-177 (2007) - [j36]James V. Burke, Adrian S. Lewis, Michael L. Overton:
Spectral conditioning and pseudospectral growth. Numerische Mathematik 107(1): 27-37 (2007) - [j35]Jérôme Bolte, Aris Daniilidis, Adrian S. Lewis:
The [barred L]ojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems. SIAM J. Optim. 17(4): 1205-1223 (2007) - [j34]Jérôme Bolte, Aris Daniilidis, Adrian S. Lewis, Masahiro Shiota:
Clarke Subgradients of Stratifiable Functions. SIAM J. Optim. 18(2): 556-572 (2007) - [j33]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
- [j32]Adrian S. Lewis, René Henrion, Alberto Seeger:
Distance to Uncontrollability for Convex Processes. SIAM J. Control. Optim. 45(1): 26-50 (2006) - [j31]James V. Burke, Didier Henrion, Adrian S. Lewis, Michael L. Overton:
Stabilization via Nonsmooth, Nonconvex Optimization. IEEE Trans. Autom. Control. 51(11): 1760-1769 (2006) - 2005
- [j30]Warren L. Hare, Adrian S. Lewis:
Estimating Tangent and Normal Cones Without Calculus. Math. Oper. Res. 30(4): 785-799 (2005) - [j29]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) - [j28]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) - 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]Adrian S. Lewis:
The Structured Distance to Ill-Posedness for Conic Systems. Math. Oper. Res. 29(4): 776-785 (2004) - [j25]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
- [j24]Adrian S. Lewis:
The mathematics of eigenvalue optimization. Math. Program. 97(1-2): 155-176 (2003) - [j23]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) - 2002
- [j22]James V. Burke, Adrian S. Lewis, Michael L. Overton:
Approximating Subdifferentials by Random Sampling of Gradients. Math. Oper. Res. 27(3): 567-584 (2002) - [j21]Adrian S. Lewis:
Active Sets, Nonsmoothness, and Sensitivity. SIAM J. Optim. 13(3): 702-725 (2002) - 2001
- [j20]James V. Burke, Adrian S. Lewis, Michael L. Overton:
Optimal Stability and Eigenvalue Multiplicity. Found. Comput. Math. 1(2): 205-225 (2001) - [j19]Adrian S. Lewis, Hristo S. Sendov:
Self-concordant barriers for hyperbolic means. Math. Program. 91(1): 1-10 (2001) - [j18]Adrian S. Lewis, Hristo S. Sendov:
Twice Differentiable Spectral Functions. SIAM J. Matrix Anal. Appl. 23(2): 368-386 (2001) - [c2]J. P. Stitt, R. L. Tutwiler, Adrian S. Lewis:
Fuzzy c-means image segmentation of side-scan sonar images. SIP 2001: 27-32 - 2000
- [j17]Adrian S. Lewis, R. E. Lucchetti:
Nonsmooth Duality, Sandwich, and Squeeze Theorems. SIAM J. Control. Optim. 38(2): 613-626 (2000) - [j16]Adrian S. Lewis:
Lidskii's Theorem via Nonsmooth Analysis. SIAM J. Matrix Anal. Appl. 21(2): 379-381 (2000)
1990 – 1999
- 1999
- [j15]Jean-Baptiste Hiriart-Urruty, Adrian S. Lewis:
The Clarke and Michel-Penot Subdifferentials of the Eigenvalues of a Symmetric Matrix. Comput. Optim. Appl. 13(1-3): 13-23 (1999) - [j14]Adrian S. Lewis:
Ill-Conditioned Convex Processes and Conic Linear Systems. Math. Oper. Res. 24(4): 829-834 (1999) - [j13]Adrian S. Lewis:
Nonsmooth analysis of eigenvalues. Math. Program. 84(1): 1-24 (1999) - 1996
- [j12]Jonathan M. Borwein, Adrian S. Lewis, Dominikus Noll:
Maximum Entropy Reconstruction Using Derivative Information, Part 1: Fisher Information and Convex Duality. Math. Oper. Res. 21(2): 442-468 (1996) - [j11]Adrian S. Lewis:
Derivatives of Spectral Functions. Math. Oper. Res. 21(3): 576-588 (1996) - [j10]Adrian S. Lewis:
Convex Analysis on the Hermitian Matrices. SIAM J. Optim. 6(1): 164-177 (1996) - [j9]Adrian S. Lewis:
Group Invariance and Convex Matrix Analysis. SIAM J. Matrix Anal. Appl. 17(4): 927-949 (1996) - 1994
- [j8]Adrian S. Lewis:
Facial reduction in partially finite convex programming. Math. Program. 65: 123-138 (1994) - [j7]Jonathan M. Borwein, Adrian S. Lewis:
Strong Rotundity and Optimization. SIAM J. Optim. 4(1): 146-158 (1994) - 1993
- [j6]Jonathan M. Borwein, Adrian S. Lewis:
Partially-Finite Programming in L1 and the Existence of Maximum Entropy Estimates. SIAM J. Optim. 3(2): 248-267 (1993) - 1992
- [j5]Jonathan M. Borwein, Adrian S. Lewis:
Partially finite convex programming, Part I: Quasi relative interiors and duality theory. Math. Program. 57: 15-48 (1992) - [j4]Jonathan M. Borwein, Adrian S. Lewis:
Partially finite convex programming, Part II: Explicit lattice models. Math. Program. 57: 49-83 (1992) - [j3]Adrian S. Lewis, Gregory P. Knowles:
Image compression using the 2-D wavelet transform. IEEE Trans. Image Process. 1(2): 244-250 (1992) - 1991
- [j2]Jonathan M. Borwein, Adrian S. Lewis:
Convergence of Best Entropy Estimates. SIAM J. Optim. 1(2): 191-205 (1991) - [c1]Adrian S. Lewis, Gregory P. Knowles:
A 64 Kb/s Video Codec Using the 2-D Wavelet Transform. Data Compression Conference 1991: 196-201
1980 – 1989
- 1989
- [j1]Edward J. Anderson, Adrian S. Lewis:
An extension of the simplex algorithm for semi-infinite linear programming. Math. Program. 44(1-3): 247-269 (1989)
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 2025-02-18 01:15 CET 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:
