An extension of the simplex algorithm for semi-infinite linear programming. - Edward J. Anderson; Adrian S. Lewis (Math. Program., 1989)

A 64 Kb/s Video Codec Using the 2-D Wavelet Transform. - Adrian S. Lewis; Gregory P. Knowles (Data Compression Conference, 1991)

Convergence of Best Entropy Estimates. - Jonathan M. Borwein; Adrian S. Lewis (SIAM J. Optim., 1991)

Partially finite convex programming, Part I: Quasi relative interiors and duality theory. - Jonathan M. Borwein; Adrian S. Lewis (Math. Program., 1992)

Partially finite convex programming, Part II: Explicit lattice models. - Jonathan M. Borwein; Adrian S. Lewis (Math. Program., 1992)

Image compression using the 2-D wavelet transform. - Adrian S. Lewis; Gregory P. Knowles (IEEE Trans. Image Process., 1992)

Partially-Finite Programming in L1 and the Existence of Maximum Entropy Estimates. - Jonathan M. Borwein; Adrian S. Lewis (SIAM J. Optim., 1993)

Facial reduction in partially finite convex programming. - Adrian S. Lewis (Math. Program., 1994)

Strong Rotundity and Optimization. - Jonathan M. Borwein; Adrian S. Lewis (SIAM J. Optim., 1994)

Maximum Entropy Reconstruction Using Derivative Information, Part 1: Fisher Information and Convex Duality. - Jonathan M. Borwein; Adrian S. Lewis; Dominikus Noll (Math. Oper. Res., 1996)

Derivatives of Spectral Functions. - Adrian S. Lewis (Math. Oper. Res., 1996)

Convex Analysis on the Hermitian Matrices. - Adrian S. Lewis (SIAM J. Optim., 1996)

Group Invariance and Convex Matrix Analysis. - Adrian S. Lewis (SIAM J. Matrix Anal. Appl., 1996)

The Clarke and Michel-Penot Subdifferentials of the Eigenvalues of a Symmetric Matrix. - Jean-Baptiste Hiriart-Urruty; Adrian S. Lewis (Comput. Optim. Appl., 1999)

Ill-Conditioned Convex Processes and Conic Linear Systems. - Adrian S. Lewis (Math. Oper. Res., 1999)

Nonsmooth analysis of eigenvalues. - Adrian S. Lewis (Math. Program., 1999)

Nonsmooth Duality, Sandwich, and Squeeze Theorems. - Adrian S. Lewis; R. E. Lucchetti (SIAM J. Control. Optim., 2000)

Lidskii's Theorem via Nonsmooth Analysis. - Adrian S. Lewis (SIAM J. Matrix Anal. Appl., 2000)

Fuzzy c-means image segmentation of side-scan sonar images. - J. P. Stitt; R. L. Tutwiler; Adrian S. Lewis (SIP, 2001)

Optimal Stability and Eigenvalue Multiplicity. - James V. Burke; Adrian S. Lewis; Michael L. Overton (Found. Comput. Math., 2001)

Self-concordant barriers for hyperbolic means. - Adrian S. Lewis; Hristo S. Sendov (Math. Program., 2001)

Twice Differentiable Spectral Functions. - Adrian S. Lewis; Hristo S. Sendov (SIAM J. Matrix Anal. Appl., 2001)

Approximating Subdifferentials by Random Sampling of Gradients. - James V. Burke; Adrian S. Lewis; Michael L. Overton (Math. Oper. Res., 2002)

Active Sets, Nonsmoothness, and Sensitivity. - Adrian S. Lewis (SIAM J. Optim., 2002)

The mathematics of eigenvalue optimization. - Adrian S. Lewis (Math. Program., 2003)

Optimization and Pseudospectra, with Applications to Robust Stability. - James V. Burke; Adrian S. Lewis; Michael L. Overton (SIAM J. Matrix Anal. Appl., 2003)

Variational Analysis of the Abscissa Mapping for Polynomials via the Gauss-Lucas Theorem. - James V. Burke; Adrian S. Lewis; Michael L. Overton (J. Glob. Optim., 2004)

The Structured Distance to Ill-Posedness for Conic Systems. - Adrian S. Lewis (Math. Oper. Res., 2004)

Pseudospectral Components and the Distance to Uncontrollability. - James V. Burke; Adrian S. Lewis; Michael L. Overton (SIAM J. Matrix Anal. Appl., 2004)

Estimating Tangent and Normal Cones Without Calculus. - Warren L. Hare; Adrian S. Lewis (Math. Oper. Res., 2005)

Variational analysis of functions of the roots of polynomials. - James V. Burke; Adrian S. Lewis; Michael L. Overton (Math. Program., 2005)

A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization. - James V. Burke; Adrian S. Lewis; Michael L. Overton (SIAM J. Optim., 2005)

Distance to Uncontrollability for Convex Processes. - Adrian S. Lewis; René Henrion; Alberto Seeger (SIAM J. Control. Optim., 2006)

Stabilization via Nonsmooth, Nonconvex Optimization. - James V. Burke; Didier Henrion; Adrian S. Lewis; Michael L. Overton (IEEE Trans. Autom. Control., 2006)

Identifying Active Manifolds. - Warren L. Hare; Adrian S. Lewis (Algorithmic Oper. Res., 2007)

Nonsmooth optimization and robust control. - Adrian S. Lewis (Annu. Rev. Control., 2007)

Spectral conditioning and pseudospectral growth. - James V. Burke; Adrian S. Lewis; Michael L. Overton (Numerische Mathematik, 2007)

The [barred L]ojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems. - Jérôme Bolte; Aris Daniilidis; Adrian S. Lewis (SIAM J. Optim., 2007)

Clarke Subgradients of Stratifiable Functions. - Jérôme Bolte; Aris Daniilidis; Adrian S. Lewis; Masahiro Shiota (SIAM J. Optim., 2007)

Convexity and Lipschitz Behavior of Small Pseudospectra. - James V. Burke; Adrian S. Lewis; Michael L. Overton (SIAM J. Matrix Anal. Appl., 2007)

Alternating Projections on Manifolds. - Adrian S. Lewis; Jérôme Malick (Math. Oper. Res., 2008)

Variational Analysis of Pseudospectra. - Adrian S. Lewis; Chin How Jeffrey Pang (SIAM J. Optim., 2008)

Local Linear Convergence for Alternating and Averaged Nonconvex Projections. - Adrian S. Lewis; D. Russell Luke; Jérôme Malick (Found. Comput. Math., 2009)

Tame functions are semismooth. - Jérôme Bolte; Aris Daniilidis; Adrian S. Lewis (Math. Program., 2009)

Lipschitz Behavior of the Robust Regularization. - Adrian S. Lewis; Chin How Jeffrey Pang (SIAM J. Control. Optim., 2009)

Randomized Methods for Linear Constraints: Convergence Rates and Conditioning. - D. Leventhal; Adrian S. Lewis (Math. Oper. Res., 2010)

Generic Optimality Conditions for Semialgebraic Convex Programs. - Jérôme Bolte; Aris Daniilidis; Adrian S. Lewis (Math. Oper. Res., 2011)

Identifying Activity. - Adrian S. Lewis; Stephen J. Wright 001 (SIAM J. Optim., 2011)

Semi-algebraic functions have small subdifferentials. - Dmitriy Drusvyatskiy; Adrian S. Lewis (Math. Program., 2013)

Nonsmooth optimization via quasi-Newton methods. - Adrian S. Lewis; Michael L. Overton (Math. Program., 2013)

Tilt Stability, Uniform Quadratic Growth, and Strong Metric Regularity of the Subdifferential. - Dmitriy Drusvyatskiy; Adrian S. Lewis (SIAM J. Optim., 2013)

Partial Smoothness, Tilt Stability, and Generalized Hessians. - Adrian S. Lewis; Shanshan Zhang (SIAM J. Optim., 2013)

Optimality, identifiability, and sensitivity. - Dmitriy Drusvyatskiy; Adrian S. Lewis (Math. Program., 2014)

Orthogonal Invariance and Identifiability. - Aris Daniilidis; Dmitriy Drusvyatskiy; Adrian S. Lewis (SIAM J. Matrix Anal. Appl., 2014)

Transversality and Alternating Projections for Nonconvex Sets. - Dmitriy Drusvyatskiy; Alexander D. Ioffe; Adrian S. Lewis (Found. Comput. Math., 2015)

Nonsmoothness and a Variable Metric Method. - Adrian S. Lewis; Shuwei Zhang (J. Optim. Theory Appl., 2015)

Clarke Subgradients for Directionally Lipschitzian Stratifiable Functions. - Dmitriy Drusvyatskiy; Alexander D. Ioffe; Adrian S. Lewis (Math. Oper. Res., 2015)

Curves of Descent. - Dmitriy Drusvyatskiy; Alexander D. Ioffe; Adrian S. Lewis (SIAM J. Control. Optim., 2015)

A proximal method for composite minimization. - Adrian S. Lewis; Stephen J. Wright 001 (Math. Program., 2016)

Generic Minimizing Behavior in Semialgebraic Optimization. - Dmitriy Drusvyatskiy; Alexander D. Ioffe; Adrian S. Lewis (SIAM J. Optim., 2016)

Variational analysis of the Crouzeix ratio. - Anne Greenbaum; Adrian S. Lewis; Michael L. Overton (Math. Program., 2017)

Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods. - Dmitriy Drusvyatskiy; Adrian S. Lewis (Math. Oper. Res., 2018)

Nonsmooth Variants of Powell's BFGS Convergence Theorem. - Jiayi Guo; Adrian S. Lewis (SIAM J. Optim., 2018)

A simple Newton method for local nonsmooth optimization. - Adrian S. Lewis; Calvin J. S. Wylie (CoRR, 2019)

Partial Smoothness of the Numerical Radius at Matrices Whose Fields of Values are Disks. - Adrian S. Lewis; Michael L. Overton (SIAM J. Matrix Anal. Appl., 2020)

Active-Set Newton Methods and Partial Smoothness. - Adrian S. Lewis; Calvin J. S. Wylie (Math. Oper. Res., 2021)

Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria. - Dmitriy Drusvyatskiy; Alexander D. Ioffe; Adrian S. Lewis (Math. Program., 2021)

The Structure of Conservative Gradient Fields. - Adrian S. Lewis; Tonghua Tian (SIAM J. Optim., 2021)

Local Linear Convergence of Alternating Projections in Metric Spaces with Bounded Curvature. - Adrian S. Lewis; Genaro López-Acedo; Adriana Nicolae (SIAM J. Optim., 2022)

Partial Smoothness and Constant Rank. - Adrian S. Lewis; Jingwei Liang; Tonghua Tian (SIAM J. Optim., 2022)

Survey Descent: A Multipoint Generalization of Gradient Descent for Nonsmooth Optimization. - X. Y. Han; Adrian S. Lewis (SIAM J. Optim., 2023)

Horoballs and the subgradient method. - Adrian S. Lewis; Genaro López-Acedo; Adriana Nicolae (CoRR, 2024)

Lipschitz minimization and the Goldstein modulus. - Siyu Kong; Adrian S. Lewis (CoRR, 2024)

Recognizing weighted means in geodesic spaces. - Ariel Goodwin; Adrian S. Lewis; Genaro López-Acedo; Adriana Nicolae (CoRR, 2024)

A subgradient splitting algorithm for optimization on nonpositively curved metric spaces. - Ariel Goodwin; Adrian S. Lewis; Genaro López-Acedo; Adriana Nicolae (CoRR, 2024)

The Cost of Nonconvexity in Deterministic Nonsmooth Optimization. - Siyu Kong; Adrian S. Lewis (Math. Oper. Res., 2024)

Basic Convex Analysis in Metric Spaces with Bounded Curvature. - Adrian S. Lewis; Genaro López-Acedo; Adriana Nicolae (SIAM J. Optim., 2024)

Convex optimization on CAT(0) cubical complexes. - Ariel Goodwin; Adrian S. Lewis; Genaro López-Acedo; Adriana Nicolae (Adv. Appl. Math., 2025)

Identifiability, the KL Property in Metric Spaces, and Subgradient Curves. - Adrian S. Lewis; Tonghua Tian (Found. Comput. Math., 2025)

The complexity of first-order optimization methods from a metric perspective. - Adrian S. Lewis; Tonghua Tian (Math. Program., 2025)