A. S. Lewis
Computational Theory and Mathematics · 1998–2016
A researcher in the Science corpus: 19 papers; trusts 32 researchers and is trusted by 118 researchers here, as inferred from the citation graph.
Subfields
- Computational Theory and Mathematics — 48 citations into it; #723 of 12,489 by trust here, #1,050 by citations
- Numerical Analysis — 33 citations into it; #75 of 3,703 by trust here, #61 by citations
- Applied Mathematics — 21 citations into it; #1,610 of 7,714 by trust here, #1,220 by citations
- Optimization & Training — 19 citations into it; #1,300 of 2,605 by trust here, #1,989 by citations
- Computational Mechanics — 14 citations into it; #440 of 10,021 by trust here, #1,333 by citations
- Mathematical Physics — 14 citations into it
- Geometry and Topology — 11 citations into it; #1,242 of 7,435 by trust here, #949 by citations
- Artificial Intelligence — 9 citations into it; #4,940 of 36,961 by trust here, #14,258 by citations
Whom A. S. Lewis trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- James V. Burke
- Yurii E. Nesterov
- Zhi-Quan Tom Luo
- Bastian Goldlücke
- M. Powell
- R. Tyrrell Rockafellar
- Roger A. Horn
- Michael L. Overton
- Asen L. Dontchev
- Jong-Shi Pang
Who trusts A. S. Lewis overall
- Peter Richtárik
- Nicolas Loizou
- Francis R. Bach
- Adam W. Marcus
- Jérôme Bolte
- Shai Shalev-Shwartz
- Daniel Petersson
- James V. Burke
- Jonathan Michael Borwein
- Jakub Konecný
Papers from A. S. Lewis's perspective
Ordered by how strongly the researchers A. S. Lewis trusts endorse each paper. Same corpus, a different order for every researcher.
- Monotone Operators and the Proximal Point Algorithm
- Semidefinite programming
- Variational Analysis
- Addendum: Regularization and variable selection via the elastic net
- Introductory Lectures on Convex Optimization - A Basic Course
- Best approximation in inner product spaces
- Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
- Nonlinear Programming—Sequential Unconstrained Minimization Techniques
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization
- Robust stability and a criss‐cross algorithm for pseudospectra
Their papers
- Randomized Methods for Linear Constraints: Convergence Rates and Conditioning (2008) — 381 citations
- Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods (2016) — 394 citations
- The radius of metric regularity (2002) — 220 citations
- The lax conjecture is true (2003) — 190 citations
- Clarke Subgradients of Stratifiable Functions (2006) — 494 citations
- Dykstras algorithm with bregman projections: A convergence proof (2000) — 135 citations
- Hyperbolic Polynomials and Convex Analysis (2001) — 146 citations
- A nonsmooth Morse–Sard theorem for subanalytic functions (2006) — 56 citations
- A Robust Gradient Sampling Algorithm for Nonsmooth, Nonconvex Optimization (2005) — 542 citations
- Two numerical methods for optimizing matrix stability (2002) — 110 citations
- Nonsmooth optimization via quasi-Newton methods (2012) — 396 citations
- Nonsmooth Analysis of Singular Values. Part II: Applications (2005) — 60 citations
- The [barred L]ojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems (2006) — 831 citations
- Nonsmooth Analysis of Singular Values. Part I: Theory (2005) — 141 citations
- A Nonsmooth, Nonconvex Optimization Approach to Robust Stabilization by Static Output Feedback and Low-Order Controllers (2003) — 53 citations
- Robust stability and a criss‐cross algorithm for pseudospectra (2003) — 81 citations
- Identifying active constraints via partial smoothness and prox-regularity (2003) — 146 citations
- Convex Analysis And Nonlinear Optimization (2000) — 1,472 citations
- Error Bounds for Convex Inequality Systems (1998)