Interpolation conditions for linear operators and applications to performance estimation problems
From MaRDI portal
(Redirected from Publication:6601207)
Recommendations
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods
- Exact worst-case performance of first-order methods for composite convex optimization
- Worst-case convergence analysis of inexact gradient and Newton methods through semidefinite programming performance estimation
- Principled analyses and design of first-order methods with inexact proximal operators
Cites work
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A new primal-dual algorithm for minimizing the sum of three functions with a linear operator
- A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
- A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
- A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
- A splitting algorithm for dual monotone inclusions involving cocoercive operators
- A Systematic Approach to Lyapunov Analyses of Continuous-Time Models in Convex Optimization
- Accelerated proximal point method for maximally monotone operators
- An accelerated coordinate gradient descent algorithm for non-separable composite optimization
- An optimal gradient method for smooth strongly convex minimization
- An optimal variant of Kelley's cutting-plane method
- Another look at the fast iterative shrinkage/thresholding algorithm (FISTA)
- Automatic Performance Estimation for Decentralized Optimization
- Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods
- Conditions for linear convergence of the gradient method for non-convex optimization
- Efficient first-order methods for convex minimization: a constructive approach
- Exact worst-case convergence rates of the proximal gradient method for composite convex minimization
- Generalizing the optimized gradient method for smooth convex minimization
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- Initialization-free distributed algorithms for optimal resource allocation with feasibility constraints and application to economic dispatch of power systems
- Linear convergence of first order methods for non-strongly convex optimization
- Nonlinear total variation based noise removal algorithms
- Norm-Preserving Dilations and Their Applications to Optimal Error Bounds
- On the convergence analysis of the optimized gradient method
- On the convergence rate of the Halpern-iteration
- On the ergodic convergence rates of a first-order primal-dual algorithm
- On the rate of convergence of the difference-of-convex algorithm (DCA)
- On the worst-case complexity of the gradient method with exact line search for smooth strongly convex functions
- Operator splitting performance estimation: tight contraction factors and optimal parameter selection
- Optimal complexity and certification of Bregman first-order methods
- Optimized first-order methods for smooth convex minimization
- Optimizing the efficiency of first-order methods for decreasing the gradient of smooth convex functions
- PEPIT: computer-assisted worst-case analyses of first-order optimization methods in python
- Performance of first-order methods for smooth convex minimization: a novel approach
- Perturbation Theory for the Least Squares Problem with Linear Equality Constraints
- Proximal Splitting Algorithms for Convex Optimization: A Tour of Recent Advances, with New Twists
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods
- The exact worst-case convergence rate of the alternating direction method of multipliers
- Tight ergodic sublinear convergence rate of the relaxed proximal point algorithm for monotone variational inequalities
- Tight sublinear convergence rate of the proximal point algorithm for maximal monotone inclusion problems
- Worst-case convergence analysis of inexact gradient and Newton methods through semidefinite programming performance estimation
Cited in
(2)
This page was built for publication: Interpolation conditions for linear operators and applications to performance estimation problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601207)
