A relative inexact proximal gradient method with an explicit linesearch
From MaRDI portal
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A forward–backward splitting algorithm for the minimization of non-smooth convex functionals in Banach space
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives
- A partially inexact proximal alternating direction method of multipliers and its iteration-complexity analysis
- A practical relative error criterion for augmented Lagrangians
- A Statistical Model for Positron Emission Tomography
- Accelerated and inexact forward-backward algorithms
- Alternating proximal regularized dictionary learning
- An inexact accelerated proximal gradient method for large scale linearly constrained convex SDP
- An inexact proximal generalized alternating direction method of multipliers
- Approximate ADMM algorithms derived from Lagrangian splitting
- Conical averagedness and convergence analysis of fixed point algorithms
- scientific article; zbMATH DE number 5564093 (Why is no real title available?)
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 477581 (Why is no real title available?)
- scientific article; zbMATH DE number 6253954 (Why is no real title available?)
- Inexact and accelerated proximal point algorithms
- Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems
- On FISTA with a relative error rule
- On Projection Algorithms for Solving Convex Feasibility Problems
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
- On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
- On the convergence of primal-dual hybrid gradient algorithms for total variation image restoration
- On the convergence of the forward-backward splitting method with linesearches
- On the linear convergence of forward-backward splitting method. I: Convergence analysis
- On the projected subgradient method for nonsmooth convex optimization in a Hilbert space
- On Weak and Strong Convergence of the Projected Gradient Method for Convex Optimization in Real Hilbert Spaces
- Quadratic growth conditions and uniqueness of optimal solution to Lasso
- Regularization methods in Banach spaces.
- Relative-error approximate versions of Douglas-Rachford splitting and special cases of the ADMM
- Relative-error inertial-relaxed inexact versions of Douglas-Rachford and ADMM splitting algorithms
- Signal Recovery by Proximal Forward-Backward Splitting
- Stability of over-relaxations for the forward-backward algorithm, application to FISTA
- The Variable Metric Forward-Backward Splitting Algorithm Under Mild Differentiability Assumptions
- Variable metric inexact line-search-based methods for nonsmooth optimization
- Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
This page was built for publication: A relative inexact proximal gradient method with an explicit linesearch
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6982141)