Convergence analysis of a primal-dual optimization-by-continuation algorithm

DOI10.1016/J.CAM.2024.116299MaRDI QIDQ6653550zbMATH OpenFDO

Authors Ignace Loris, Simone Rebegoldi

Publication date 16 December 2024

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.CAM.2024.116299

zbMATH Keywords

iterative algorithminverse problemprimal-dual algorithmproximal algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Approximation methods and heuristics in mathematical programming (90C59) Numerical methods involving duality (49M29)

Recommendations

• A new primal-dual algorithm for minimizing the sum of three functions with a linear operator
• On the ergodic convergence rates of a first-order primal-dual algorithm
• On the convergence rate of a forward-backward type primal-dual splitting algorithm for convex optimization problems
• Primal-dual proximal algorithms for structured convex optimization: a unifying framework
• scientific article; zbMATH DE number 7071979

Cites work

• scientific article; zbMATH DE number 4015993 (Why is no real title available?)
• scientific article; zbMATH DE number 439380 (Why is no real title available?)
• scientific article; zbMATH DE number 477581 (Why is no real title available?)
• scientific article; zbMATH DE number 1376935 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 3298300 (Why is no real title available?)
• scientific article; zbMATH DE number 3365044 (Why is no real title available?)
• A first-order primal-dual algorithm for convex problems with applications to imaging
• A primal-dual splitting method for convex optimization involving Lipschitzian, proximable and linear composite terms
• An introduction to continuous optimization for imaging
• Convex analysis and monotone operator theory in Hilbert spaces
• Elastic-net regularization: error estimates and active set methods
• First-order methods in optimization
• Fixed-Point Continuation for \ell₁-Minimization: Methodology and Convergence
• Inexact and accelerated proximal point algorithms
• Inexact first-order primal-dual algorithms
• Mixed total variation and \(L^1\) regularization method for optical tomography based on radiative transfer equation
• Morozov's discrepancy principle and Tikhonov-type functionals
• Nonlinear total variation based noise removal algorithms
• On a generalization of the iterative soft-thresholding algorithm for the case of non-separable penalty
• On starting and stopping criteria for nested primal-dual iterations
• Optimization methods for large-scale machine learning
• Probing the Pareto frontier for basis pursuit solutions
• Proximité et dualité dans un espace hilbertien
• RTE-based parameter reconstruction with \(T V + L^1\) regularization
• Signal Recovery by Proximal Forward-Backward Splitting
• Sparse Optimization with Least-Squares Constraints
• Structured sparsity through convex optimization
• The Krasnosel'skiĭ-Mann Iterative Method

Cited in

(1)

• Foreword to the virtual special issue dedicated to the fourth triennial international conference and summer school NUMTA 2023 ``Numerical computations: theory and algorithms

This page was built for publication: Convergence analysis of a primal-dual optimization-by-continuation algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6653550)