Corrigendum to: ``A partially isochronous splitting algorithm for three-block separable convex minimization problems

DOI10.1007/S10444-018-9591-YMaRDI QIDQ1670407zbMATH OpenOpenAlexFDO

Authors Hongjin He, Liusheng Hou, Hong-Kun Xu

Publication date 5 September 2018

Published in Advances in Computational Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10444-018-9591-y

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Convex programming (90C25) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• Corrigendum
• Corrigendum to: ``A modified general modulus-based matrix splitting method for linear complementarity problems of \(H\)-matrices
• Correction to: ``Quantitative analysis of a subgradient-type method for equilibrium problems
• A splitting algorithm for three-block convex minimization problems
• Correction to: ``An efficient linear scheme to approximate nonlinear diffusion problems

Cited in

(7)

• Erratum to: ``An abstract model for branching and its application to mixed integer programming
• Correction
• Publisher correction to: ``An algorithm for the non-identifiability of rank-3 tensors
• Correction to: ``Accelerated proximal gradient method for bi-modulus static elasticity
• Correction to: ``The CoMirror algorithm with random constraint sampling for convex semi-infinite programming
• An inertial proximal splitting method with applications
• Corrigendum to ``Bilevel time minimizing transportation problem

This page was built for publication: Corrigendum to: ``A partially isochronous splitting algorithm for three-block separable convex minimization problems

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