Accelerating convergence of a class of splitting algorithms with iterative foldings

MaRDI QIDQ2390719zbMATH OpenFDO

Authors Arnaud Lenoir, Philippe Mahey

Publication date 3 August 2009

Published in Acta Mathematica Vietnamica (Search for Journal in Brave)

zbMATH Keywords

algorithmsoperator splittingnumerical resultsconvergence accelerationproximal decompositionproto-differentiability

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• Iterative algorithms for the split problem and its convergence analysis
• Accelerating the shift-splitting iteration algorithm
• On accelerating the convergence of nonlinear iterative algorithms
• scientific article; zbMATH DE number 151767
• Strong convergence of iterative algorithms for the split equality problem
• Fast multiple-splitting algorithms for convex optimization
• Convergence rate analysis of several splitting schemes
• scientific article; zbMATH DE number 4064340
• A fast splitting method for efficient split Bregman iterations
• Almost sure convergence of the forward-backward-forward splitting algorithm

Cited in

(1)

• A survey on operator splitting and decomposition of convex programs

This page was built for publication: Accelerating convergence of a class of splitting algorithms with iterative foldings

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