Automated tight Lyapunov analysis for first-order methods

Analysis of algorithms and problem complexity (68Q25) Semidefinite programming (90C22) Convex programming (90C25) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

On the ergodic convergence rates of a first-order primal-dual algorithm
Smooth strongly convex interpolation and exact worst-case performance of first-order methods
A three-operator splitting scheme and its optimization applications
Lectures on convex optimization
Conjugate duality in convex optimization
On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
Tight global linear convergence rate bounds for Douglas-Rachford splitting
A first-order primal-dual algorithm for convex problems with applications to imaging
Optimal complexity and certification of Bregman first-order methods
Uniqueness of DRS as the 2 operator resolvent-splitting and impossibility of 3 operator resolvent-splitting
Fixing and extending some recent results on the ADMM algorithm
Performance of first-order methods for smooth convex minimization: a novel approach
Exact algorithms for linear matrix inequalities
Linear Convergence and Metric Selection for Douglas-Rachford Splitting and ADMM
On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints
Splitting Algorithms for the Sum of Two Nonlinear Operators
System analysis via integral quadratic constraints
First-Order Methods in Optimization
A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
Robust and structure exploiting optimisation algorithms: an integral quadratic constraint approach
Analysis and Design of First-Order Distributed Optimization Algorithms Over Time-Varying Graphs
Operator Splitting Performance Estimation: Tight Contraction Factors and Optimal Parameter Selection
Data-Driven Nonsmooth Optimization
Exact Worst-Case Performance of First-Order Methods for Composite Convex Optimization
Convex analysis and monotone operator theory in Hilbert spaces
A Systematic Approach to Lyapunov Analyses of Continuous-Time Models in Convex Optimization
Principled analyses and design of first-order methods with inexact proximal operators

This page was built for publication: Automated tight Lyapunov analysis for first-order methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665382)