A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives

DOI10.5802/OJMO.12zbMath1498.90154arXiv2106.15536OpenAlexW3175461813MaRDI QIDQ2165600

Francis Bach, Mathieu Barré, Adrien B. Taylor

Publication date: 20 August 2022

Published in: OJMO. Open Journal of Mathematical Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.15536

zbMATH Keywords

approximate proximal operatorsrelative and absolute errors

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (2)

Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods ⋮ Optimal inexactness schedules for tunable oracle-based methods

Cites Work

• Nonlinear total variation based noise removal algorithms
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• Gradient methods for minimizing composite functions
• Smooth strongly convex interpolation and exact worst-case performance of first-order methods
• Enlargement of monotone operators with applications to variational inequalities
• Introductory lectures on convex optimization. A basic course.
• A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
• Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems
• An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods
• Accelerated and Inexact Forward-Backward Algorithms
• A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
• New Proximal Point Algorithms for Convex Minimization
• An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP
• Variants of the A-HPE and large-step A-HPE algorithms for strongly convex problems with applications to accelerated high-order tensor methods
• On the Subdifferentiability of Convex Functions
• An introduction to continuous optimization for imaging
• Robustness of the hybrid extragradient proximal-point algorithm.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives