Accelerated and inexact forward-backward algorithms
From MaRDI portal
Recommendations
- Inexact and accelerated proximal point algorithms
- Convergence of inexact forward-backward algorithms using the forward-backward envelope
- A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors
- New convergence results for the inexact variable metric forward-backward method
- Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems
Cited in
(only showing first 100 items - show all)- Two algorithms for solving systems of inclusion problems
- Inexact proximal stochastic gradient method for convex composite optimization
- Accelerated alternating descent methods for Dykstra-like problems
- Rate of convergence of inertial gradient dynamics with time-dependent viscous damping coefficient
- Inertial forward-backward algorithms with perturbations: application to Tikhonov regularization
- Convergence of inertial dynamics and proximal algorithms governed by maximally monotone operators
- Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates
- Under-relaxed quasi-Newton acceleration for an inverse fixed-point problem coming from positron emission tomography
- A block coordinate variable metric linesearch based proximal gradient method
- Going forth and back in time: a fast and parsimonious algorithm for mixed initial/final-value problems
- Inexact proximal \(\epsilon\)-subgradient methods for composite convex optimization problems
- Convergence of stochastic proximal gradient algorithm
- Bounds for the tracking error of first-order online optimization methods
- New strong convergence method for the sum of two maximal monotone operators
- On the inexact scaled gradient projection method
- Extrapolated smoothing descent algorithm for constrained nonconvex and nonsmooth composite problems
- On the effect of perturbations in first-order optimization methods with inertia and Hessian driven damping
- A nested primal-dual FISTA-like scheme for composite convex optimization problems
- Convergence results of a new monotone inertial forward-backward splitting algorithm under the local Hölder error bound condition
- A note on approximate accelerated forward-backward methods with absolute and relative errors, and possibly strongly convex objectives
- Inexact first-order primal-dual algorithms
- Efficient inexact proximal gradient algorithms for structured sparsity-inducing norm
- Convergence rate of inertial proximal algorithms with general extrapolation and proximal coefficients
- The multiproximal linearization method for convex composite problems
- Applying FISTA to optimization problems (with or) without minimizers
- Convergence rate of inertial forward-backward algorithm beyond Nesterov's rule
- Efficiency of minimizing compositions of convex functions and smooth maps
- Convergence analysis of an inexact three-operator splitting algorithm
- Convergence of a relaxed inertial forward-backward algorithm for structured monotone inclusions
- On the proximal Landweber Newton method for a class of nonsmooth convex problems
- Fast convergence of inertial dynamics and algorithms with asymptotic vanishing viscosity
- Inexact successive quadratic approximation for regularized optimization
- Convergence rates of accelerated proximal gradient algorithms under independent noise
- Accelerated randomized mirror descent algorithms for composite non-strongly convex optimization
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
- New convergence results for the inexact variable metric forward-backward method
- On FISTA with a relative error rule
- An abstract convergence framework with application to inertial inexact forward-backward methods
- Inexact gradient projection method with relative error tolerance
- An inexact Riemannian proximal gradient method
- Variable metric inexact line-search-based methods for nonsmooth optimization
- A stochastic inertial forward–backward splitting algorithm for multivariate monotone inclusions
- Conditional gradient sliding for convex optimization
- Scaling techniques for -subgradient methods
- The rate of convergence of Nesterov's accelerated forward-backward method is actually faster than 1/k^2
- A variable metric forward-backward method with extrapolation
- Stochastic forward-backward splitting for monotone inclusions
- Gradient sliding for composite optimization
- Stability of over-relaxations for the forward-backward algorithm, application to FISTA
- Structured sparsity: discrete and convex approaches
- scientific article; zbMATH DE number 1989739 (Why is no real title available?)
- Proximal methods for the latent group lasso penalty
- Regularized learning schemes in feature Banach spaces
- Convergence rates of inertial forward-backward algorithms
- Utilizing second order information in minibatch stochastic variance reduced proximal iterations
- Inertial variable metric techniques for the inexact forward-backward algorithm
- Inexact and accelerated proximal point algorithms
- Sequence convergence of inexact nonconvex and nonsmooth algorithms with more realistic assumptions
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
- Subgradient method with feasible inexact projections for constrained convex optimization problems
- Fast convergence of generalized forward-backward algorithms for structured monotone inclusions
- Bregman proximal point algorithm revisited: a new inexact version and its inertial variant
- From the ravine method to the Nesterov method and vice versa: a dynamical system perspective
- Rate of convergence of the Nesterov accelerated gradient method in the subcritical case α ≤ 3
- Convergence rate of a relaxed inertial proximal algorithm for convex minimization
- Convergence of inexact forward-backward algorithms using the forward-backward envelope
- Backtracking strategies for accelerated descent methods with smooth composite objectives
- Fast Proximal Methods via Time Scaling of Damped Inertial Dynamics
- Computing the best approximation over the intersection of a polyhedral set and the doubly nonnegative cone
- A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors
- Alternating proximal regularized dictionary learning
- scientific article; zbMATH DE number 5050108 (Why is no real title available?)
- Stochastic quasi-Fejér block-coordinate fixed point iterations with random sweeping
- An introduction to continuous optimization for imaging
- Accelerated iterative regularization via dual diagonal descent
- Scaled, inexact, and adaptive generalized FISTA for strongly convex optimization
- Implicit regularization with strongly convex bias: Stability and acceleration
- Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method
- Accelerated differential inclusion for convex optimization
- ``FISTA in Banach spaces with adaptive discretisations
- Incorporating multiple a priori information for inverse problem by inexact scaled gradient projection
- A projective splitting method for monotone inclusions: iteration-complexity and application to composite optimization
- An inexact primal-dual method with correction step for a saddle point problem in image debluring
- Doubly iteratively reweighted algorithm for constrained compressed sensing models
- First order inertial optimization algorithms with threshold effects associated with dry friction
- Smoothing accelerated proximal gradient method with fast convergence rate for nonsmooth convex optimization beyond differentiability
- Convergence of inertial dynamics driven by sums of potential and nonpotential operators with implicit Newton-like damping
- Principled analyses and design of first-order methods with inexact proximal operators
- Fast optimization via inertial dynamics with closed-loop damping
- An inexact gradient mirror descent algorithm for non-smooth convex optimization
- Sharper Bounds for Proximal Gradient Algorithms with Errors
- A Riemannian Proximal Newton Method
- Accelerated forward–backward algorithms for structured monotone inclusions
- A new proximal heavy ball inexact line-search algorithm
- Extrapolated plug-and-play three-operator splitting methods for nonconvex optimization with applications to image restoration
- IML FISTA: a multilevel framework for inexact and inertial forward-backward. Application to image restoration
- Inexact fixed-point proximity algorithm for the _0 sparse regularization problem
- Iteratively Refined Image Reconstruction with Learned Attentive Regularizers
- Parameter-free FISTA by adaptive restart and backtracking
- Proximal Langevin sampling with inexact proximal mapping
This page was built for publication: Accelerated and inexact forward-backward algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2866199)
