A new convergence analysis and perturbation resilience of some accelerated proximal forward–backward algorithms with errors
From MaRDI portal
Publication:5346620
DOI10.1088/1361-6420/33/4/044001zbMath1397.90363arXiv1508.05631OpenAlexW1908006783MaRDI QIDQ5346620
Daniel Reem, Alvaro Rodolfo de Pierro
Publication date: 26 May 2017
Published in: Inverse Problems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.05631
minimization problemdecay ratesuperiorizationerror termsinexactnessFISTAaccelerated proximal forward-backward algorithm
Related Items
A new step size rule for the superiorization method and its application in computerized tomography, Convergence rates of accelerated proximal gradient algorithms under independent noise, Bounded perturbations resilient iterative methods for linear systems and least squares problems: operator-based approaches, analysis, and performance evaluation, Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization, A generalized projection-based scheme for solving convex constrained optimization problems, A telescopic Bregmanian proximal gradient method without the global Lipschitz continuity assumption, Convergence analysis of an inexact three-operator splitting algorithm, A generalized block-iterative projection method for the common fixed point problem induced by cutters
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth minimization of non-smooth functions
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
- Subgradient projection algorithms and approximate solutions of convex feasibility problems
- Fast alternating linearization methods for minimizing the sum of two convex functions
- First-order methods of smooth convex optimization with inexact oracle
- Zero-convex functions, perturbation resilience, and subgradient projections for feasibility-seeking methods
- Convergence of a proximal-like algorithm in the presence of computational errors
- Fixed point and Bregman iterative methods for matrix rank minimization
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Primal-dual first-order methods with \({\mathcal {O}(1/\varepsilon)}\) iteration-complexity for cone programming
- Maximal monotone operators and the proximal point algorithm in the presence of computational errors
- Enhancing sparsity by reweighted \(\ell _{1}\) minimization
- Subgradient projection algorithms for convex feasibility problems in the presence of computational errors
- Inexact accelerated augmented Lagrangian methods
- Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces
- A finitely convergent ``row-action method for the convex feasibility problem
- Approximate iterations in Bregman-function-based proximal algorithms
- Coupling the proximal point algorithm with approximation methods
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- On the convergence of inexact two-point Newton-like methods on Banach spaces
- A proximal point method for nonsmooth convex optimization problems in Banach spaces
- An accelerated inexact proximal point algorithm for convex minimization
- Fine tuning Nesterov's steepest descent algorithm for differentiable convex programming
- Projected subgradient minimization versus superiorization
- An inexact and nonmonotone proximal method for smooth unconstrained minimization
- Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods
- An inexact hybrid projection-proximal point algorithm for solving generalized mixed variational inequalities
- Stability of a turnpike phenomenon for approximate solutions of nonautonomous discrete-time optimal control systems
- Asymptotic behavior of inexact infinite products of nonexpansive mappings in metric spaces
- An Inexact Hybrid Generalized Proximal Point Algorithm and Some New Results on the Theory of Bregman Functions
- INEXACT VERSIONS OF PROXIMAL POINT AND AUGMENTED LAGRANGIAN ALGORITHMS IN BANACH SPACES
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- An Accelerated Hybrid Proximal Extragradient Method for Convex Optimization and Its Implications to Second-Order Methods
- Accelerated and Inexact Forward-Backward Algorithms
- Optimization with Sparsity-Inducing Penalties
- Three Strong Convergence Theorems Regarding Iterative Methods for Solving Equilibrium Problems in Reflexive Banach Spaces
- Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces
- Feasibility-Seeking and Superiorization Algorithms Applied to Inverse Treatment Planning in Radiation Therapy
- A Singular Value Thresholding Algorithm for Matrix Completion
- Convergence of a Proximal Point Method in the Presence of Computational Errors in Hilbert Spaces
- Inexact Infinite Products of Nonexpansive Mappings
- Image reconstruction from a small number of projections
- Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections
- Perturbation resilience and superiorization of iterative algorithms
- Two Strong Convergence Theorems for a Proximal Method in Reflexive Banach Spaces
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- A Class of Inexact Variable Metric Proximal Point Algorithms
- Inexact Newton Methods
- Monotone Operators and the Proximal Point Algorithm
- A Variable Metric Proximal Point Algorithm for Monotone Operators
- Inexact Variants of the Proximal Point Algorithm without Monotonicity
- On inexact generalized proximal methods with a weakened error tolerance criterion
- Solving monotone inclusions via compositions of nonexpansive averaged operators
- On Projection Algorithms for Solving Convex Feasibility Problems
- Iteration-Complexity of a Newton Proximal Extragradient Method for Monotone Variational Inequalities and Inclusion Problems
- An Inexact Accelerated Proximal Gradient Method for Large Scale Linearly Constrained Convex SDP
- Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Bounded perturbation resilience of projected scaled gradient methods
