ITERATION METHODS TO COMPUTE THE SEPARABLE CONVEX MINIMIZATION PROBLEMS

DOI10.17654/NM015010079zbMATH Open1357.65049OpenAlexW2325444688MaRDI QIDQ2969317

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

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

Related Items (3)

An iterative algorithm for approximating convex minimization problem ⋮ 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)