On starting and stopping criteria for nested primal-dual iterations

DOI10.1007/s11075-018-0616-xOpenAlexW2809144406MaRDI QIDQ2274163

Jixin Chen, Ignace Loris

Publication date: 19 September 2019

Published in: Numerical Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

optimizationconvergencestopping ruleprimal-dual algorithmforward-backward splittingstarting rule

Mathematics Subject Classification ID

Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Numerical optimization and variational techniques (65K10)

Related Items (2)

Choice of the parameters in a primal-dual algorithm for Bregman iterated variational regularization ⋮ A nested primal-dual FISTA-like scheme for composite convex optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• A primal-dual fixed point algorithm for minimization of the sum of three convex separable functions
• On the ergodic convergence rates of a first-order primal-dual algorithm
• A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
• Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators
• Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
• On the convergence of the iterates of the ``fast iterative shrinkage/thresholding algorithm
• A unified primal-dual algorithm framework based on Bregman iteration
• Some first-order algorithms for total variation based image restoration
• An algorithm for total variation minimization and applications
• A simple algorithm for a class of nonsmooth convex-concave saddle-point problems
• A first-order primal-dual algorithm for convex problems with applications to imaging
• A splitting algorithm for dual monotone inclusions involving cocoercive operators
• On the convergence rate improvement of a primal-dual splitting algorithm for solving monotone inclusion problems
• Variable Metric Inexact Line-Search-Based Methods for Nonsmooth Optimization
• On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
• Nested Iterative Algorithms for Convex Constrained Image Recovery Problems
• A scaled gradient projection method for constrained image deblurring
• First-Order Methods in Optimization
• Sparsity and Smoothness Via the Fused Lasso
• A primal–dual fixed point algorithm for convex separable minimization with applications to image restoration
• On the convergence of a linesearch based proximal-gradient method for nonconvex optimization
• Fast Gradient-Based Algorithms for Constrained Total Variation Image Denoising and Deblurring Problems
• Model Selection and Estimation in Regression with Grouped Variables
• Signal Recovery by Proximal Forward-Backward Splitting
• Variable metric forward–backward splitting with applications to monotone inclusions in duality
• Proximité et dualité dans un espace hilbertien
• Convex programming in Hilbert space
• Convex Analysis
• An introduction to continuous optimization for imaging
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: On starting and stopping criteria for nested primal-dual iterations