An accelerated inexact proximal point algorithm for convex minimization
From MaRDI portal
Recommendations
Cites work
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Variable Metric Proximal Point Algorithm for Monotone Operators
- Approximate iterations in Bregman-function-based proximal algorithms
- scientific article; zbMATH DE number 4079168 (Why is no real title available?)
- Monotone Operators and the Proximal Point Algorithm
- New Proximal Point Algorithms for Convex Minimization
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Proximité et dualité dans un espace hilbertien
Cited in
(25)- Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems
- The developments of proximal point algorithms
- Inexact first-order primal-dual algorithms
- Accelerated proximal point method for maximally monotone operators
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- Convergence analysis of an inexact three-operator splitting algorithm
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
- Inexact accelerated high-order proximal-point methods
- An inexact proximal method for quasiconvex minimization
- New Proximal Point Algorithms for Convex Minimization
- Catalyst acceleration for first-order convex optimization: from theory to practice
- Inexact and accelerated proximal point algorithms
- Efficient proximal point algorithm for convex composite optimization
- The indefinite proximal point algorithms for maximal monotone operators
- Bregman proximal point algorithm revisited: a new inexact version and its inertial variant
- Accelerated Schemes for the $L_1/L_2$ Minimization
- A new convergence analysis and perturbation resilience of some accelerated proximal forward-backward algorithms with errors
- Reducing the Complexity of Two Classes of Optimization Problems by Inexact Accelerated Proximal Gradient Method
- A new accuracy criterion for approximate proximal point algorithms
- Accelerated differential inclusion for convex optimization
- IML FISTA: a multilevel framework for inexact and inertial forward-backward. Application to image restoration
- Inertial accelerated augmented Lagrangian algorithms with scaling coefficients to solve exactly and inexactly linearly constrained convex optimization problems
- Fast proximity-gradient algorithms for structured convex optimization problems
- Inexact accelerated augmented Lagrangian methods
This page was built for publication: An accelerated inexact proximal point algorithm for convex minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1937079)
