Computer-assisted design of accelerated composite optimization methods: OptISTA
From MaRDI portal
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
- Accelerated proximal point method for maximally monotone operators
- An accelerated hybrid proximal extragradient method for convex optimization and its implications to second-order methods
- An elementary approach to tight worst case complexity analysis of gradient based methods
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- 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)
- Branch-and-bound performance estimation programming: a unified methodology for constructing optimal optimization methods
- Conditional gradient methods. From core principles to AI applications
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Ergodic convergence to a zero of the sum of monotone operators in Hilbert space
- Exact worst-case performance of first-order methods for composite convex optimization
- Factor-\(\sqrt{2}\) acceleration of accelerated gradient methods
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- First-order methods in optimization
- Fixed-Point Continuation for \ell₁-Minimization: Methodology and Convergence
- Global optimization. Theory, algorithms, and applications
- scientific article; zbMATH DE number 3833218 (Why is no real title available?)
- scientific article; zbMATH DE number 3850830 (Why is no real title available?)
- scientific article; zbMATH DE number 3790208 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 1944141 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- scientific article; zbMATH DE number 3359250 (Why is no real title available?)
- Information-based complexity of linear operator equations
- Large-scale convex optimization. Algorithms \& analyses via monotone operators
- Lectures on convex optimization
- Lower bounds for finding stationary points I
- Lower bounds for finding stationary points II: first-order methods
- Monotone Operators and the Proximal Point Algorithm
- New Proximal Point Algorithms for Convex Minimization
- On optimality of Krylov's information when solving linear operator equations
- On the convergence analysis of the optimized gradient method
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- On the convergence rate of the Halpern-iteration
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- On the oracle complexity of smooth strongly convex minimization
- On the weak convergence of an ergodic iteration for the solution of variational inequalities for monotone operators in Hilbert space
- 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
- Optimization and nonsmooth analysis
- 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
- Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization
- Principled analyses and design of first-order methods with inexact proximal operators
- Produits infinis de resolvantes
- Smooth strongly convex interpolation and exact worst-case performance of first-order methods
- Sparse Reconstruction by Separable Approximation
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- The exact information-based complexity of smooth convex minimization
- Why Simple Shrinkage Is Still Relevant for Redundant Representations?
- Worst-case convergence analysis of inexact gradient and Newton methods through semidefinite programming performance estimation
This page was built for publication: Computer-assisted design of accelerated composite optimization methods: OptISTA
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7349074)
