PEPIT: computer-assisted worst-case analyses of first-order optimization methods in python
From MaRDI portal
Recommendations
- Performance of first-order methods for smooth convex minimization: a novel approach
- Exact worst-case performance of first-order methods for composite convex optimization
- Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods
- Optimizing first-order methods for smooth convex minimization of gradient Q-linearly convergence
Cites work
- A frequency-domain analysis of inexact gradient methods
- Accelerated proximal point method for maximally monotone operators
- An optimal gradient method for smooth strongly convex minimization
- Analysis and Design of First-Order Distributed Optimization Algorithms Over Time-Varying Graphs
- Analysis and design of optimization algorithms via integral quadratic constraints
- Analysis of optimization algorithms via integral quadratic constraints: nonstrongly convex problems
- Conic optimization via operator splitting and homogeneous self-dual embedding
- CVXPY: a Python-embedded modeling language for convex optimization
- Exact worst-case convergence rates of the proximal gradient method for composite convex minimization
- Exact worst-case performance of first-order methods for composite convex optimization
- Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- Information-based complexity of linear operator equations
- On the convergence rate of the Halpern-iteration
- Operator splitting performance estimation: tight contraction factors and optimal parameter selection
- Optimized first-order methods for smooth convex minimization
- Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions
- Performance of first-order methods for smooth convex minimization: a novel approach
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods
- The exact worst-case convergence rate of the gradient method with fixed step lengths for \(L\)-smooth functions
- Tight sublinear convergence rate of the proximal point algorithm for maximal monotone inclusion problems
Cited in
(4)- Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods
- Interpolation conditions for linear operators and applications to performance estimation problems
- Accelerated gradient descent by concatenation of stepsize schedules
- A constructive approach to strengthen algebraic descriptions of function and operator classes
This page was built for publication: PEPIT: computer-assisted worst-case analyses of first-order optimization methods in python
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6645946)
