Adrien B. Taylor

From MaRDI portal
Revision as of 03:30, 12 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Adrien B. Taylor to Adrien B. Taylor: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:507322

Available identifiers

zbMath Open taylor.adrien-bMaRDI QIDQ507322

List of research outcomes





PublicationDate of PublicationType
Automated tight Lyapunov analysis for first-order methods2025-01-17Paper
PEPIT: computer-assisted worst-case analyses of first-order optimization methods in python2024-11-29Paper
On Fundamental Proof Structures in First-Order Optimization2023-10-03Paper
A Systematic Approach to Lyapunov Analyses of Continuous-Time Models in Convex Optimization2023-08-11Paper
Principled analyses and design of first-order methods with inexact proximal operators2023-08-01Paper
Provable non-accelerations of the heavy-ball method2023-07-20Paper
An optimal gradient method for smooth strongly convex minimization2023-05-02Paper
Counter-examples in first-order optimization: a constructive approach2023-03-18Paper
Nonlinear conjugate gradient methods: worst-case convergence rates via computer-assisted analyses2023-01-04Paper
Convergence of Proximal Point and Extragradient-Based Methods Beyond Monotonicity: the Case of Negative Comonotonicity2022-10-25Paper
Quadratic minimization: from conjugate gradient to an adaptive Heavy-ball method with Polyak step-sizes2022-10-12Paper
A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives2022-08-20Paper
Convergence of a Constrained Vector Extrapolation Scheme2022-07-15Paper
Optimal complexity and certification of Bregman first-order methods2022-06-29Paper
Optimal first-order methods for convex functions with a quadratic upper bound2022-05-30Paper
Last-Iterate Convergence of Optimistic Gradient Method for Monotone Variational Inequalities2022-05-17Paper
On the oracle complexity of smooth strongly convex minimization2021-11-25Paper
Super-Acceleration with Cyclical Step-sizes2021-06-17Paper
Convergence of Constrained Anderson Acceleration2020-10-29Paper
Efficient first-order methods for convex minimization: a constructive approach2020-10-21Paper
Operator Splitting Performance Estimation: Tight Contraction Factors and Optimal Parameter Selection2020-09-17Paper
Worst-Case Convergence Analysis of Inexact Gradient and Newton Methods Through Semidefinite Programming Performance Estimation2020-08-18Paper
Operator Splitting Performance Estimation: Tight contraction factors and optimal parameter selection2018-12-01Paper
Exact worst-case convergence rates of the proximal gradient method for composite convex minimization2018-09-04Paper
Lyapunov Functions for First-Order Methods: Tight Automated Convergence Guarantees2018-03-16Paper
On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions2017-11-09Paper
Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization2017-07-11Paper
Smooth strongly convex interpolation and exact worst-case performance of first-order methods2017-02-03Paper
A Mushy Region in a Stefan Problem1983-01-01Paper
Automated tight Lyapunov analysis for first-order methodsN/APaper
Geometry-dependent matching pursuit: a transition phase for convergence on linear regression and LASSON/APaper

Research outcomes over time

This page was built for person: Adrien B. Taylor