Iteration methods to compute the separable convex minimization problems

DOI10.17654/NM015010079MaRDI QIDQ2969317zbMATH OpenOpenAlexFDO

Authors Cheng-Zhi Zhou, Dandan Du, Xianwei Xiao, Zhen-Yun Peng

Publication date 14 March 2017

Published in International Journal of Numerical Methods and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.17654/nm015010079

zbMATH Keywords

global convergenceiteration methodlinear constraints

Mathematics Subject Classification ID

Matrix equations and identities (15A24) Linear inequalities of matrices (15A39)

Recommendations

• A splitting method for separable convex programming
• A splitting algorithm for three-block convex minimization problems
• scientific article; zbMATH DE number 871324
• Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
• An inexact hybrid splitting method for separable convex optimization

Cited in

(4)

• An iterative algorithm for approximating convex minimization problem
• scientific article; zbMATH DE number 6378119 (Why is no real title available?)
• A scheme of iterative minimization methods
• Iteration complexity on the generalized Peaceman–Rachford splitting method for separable convex programming

This page was built for publication: Iteration methods to compute the separable convex minimization problems

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