The following pages link to Adrian S. Lewis (Q229615):
Displaying 50 items.
- (Q203865) (redirect page) (← links)
- A proximal method for composite minimization (Q304260) (← links)
- Semi-algebraic functions have small subdifferentials (Q359626) (← links)
- Nonsmooth optimization via quasi-Newton methods (Q378113) (← links)
- Optimality, identifiability, and sensitivity (Q463741) (← links)
- Level set methods for finding critical points of mountain pass type (Q544171) (← links)
- The dimension of semialgebraic subdifferential graphs (Q654064) (← links)
- Convex analysis and nonlinear optimization. Theory and examples. (Q817931) (← links)
- Local linear convergence for alternating and averaged nonconvex projections (Q839655) (← links)
- Transversality and alternating projections for nonconvex sets (Q895706) (← links)
- (Q959960) (redirect page) (← links)
- Tame functions are semismooth (Q959961) (← links)
- Partially finite convex programming. I: Quasi relative interiors and duality theory (Q1198328) (← links)
- Partially finite convex programming. II: Explicit lattice models (Q1198329) (← links)
- The Clarke and Michel-Penot subdifferentials of the eigenvalues of a symmetric matrix (Q1294817) (← links)
- Contours of Liapunov functions (Q1321451) (← links)
- Convergence of decreasing sequences of convex sets in nonreflexive Banach spaces (Q1321595) (← links)
- Entropy minimization, \(DAD\) problems, and doubly stochastic kernels (Q1332191) (← links)
- Facial reduction in partially finite convex programming (Q1334956) (← links)
- Entropy minimization with lattice bounds (Q1335038) (← links)
- Moment-matching and best entropy estimation (Q1336221) (← links)
- Maximum entropy reconstruction using derivative information. II: Computational results (Q1347042) (← links)
- Eigenvalue-constrained faces (Q1375525) (← links)
- The mathematics of eigenvalue optimization (Q1403286) (← links)
- Nonsmooth analysis of eigenvalues (Q1572662) (← links)
- Convex analysis and nonlinear optimization. Theory and examples (Q1580079) (← links)
- Convex analysis on Cartan subspaces. (Q1582400) (← links)
- Two numerical methods for optimizing matrix stability (Q1611899) (← links)
- An extension of the simplex algorithm for semi-infinite linear programming (Q1824547) (← links)
- Superresolution in the Markov moment problem (Q1916750) (← links)
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria (Q2220664) (← links)
- Local linear convergence for inexact alternating projections on nonconvex sets (Q2330978) (← links)
- Nonsmoothness and a variable metric method (Q2346393) (← links)
- Variational analysis of the Crouzeix ratio (Q2364491) (← links)
- Perturbations and metric regularity (Q2490473) (← links)
- A nonsmooth Morse--Sard theorem for subanalytic functions (Q2496693) (← links)
- Nonsmooth analysis of singular values. I: Theory (Q2572925) (← links)
- Nonsmooth analysis of singular values. II: Applications (Q2572926) (← links)
- Variational analysis of the abscissa mapping for polynomials via the Gauss-Lucas theorem (Q2574760) (← links)
- Variational analysis of functions of the roots of polynomials (Q2576723) (← links)
- Spectral conditioning and pseudospectral growth (Q2642284) (← links)
- Optimizing matrix stability (Q2706575) (← links)
- Dykstras algorithm with bregman projections: A convergence proof (Q2709445) (← links)
- Hyperbolic Polynomials and Convex Analysis (Q2715679) (← links)
- Ill-Conditioned Convex Processes and Conic Linear Systems (Q2757611) (← links)
- (Q2776675) (← links)
- Twice Differentiable Spectral Functions (Q2784352) (← links)
- Generic Minimizing Behavior in Semialgebraic Optimization (Q2789611) (← links)
- Curves of Descent (Q2810053) (← links)
- Orthogonal Invariance and Identifiability (Q2923360) (← links)
