An inexact hybrid splitting method for separable convex optimization

DOI10.7631/ISSN.1000-2243.2015.03.0305MaRDI QIDQ3463040zbMATH OpenFDO

Authors Yu-Hua Zeng, Yun Yang, Zheng Peng

Publication date 15 January 2016

Full work available at URL https://doi.org/10.7631/ISSN.1000-2243.2015.03.0305

zbMATH Keywords

alternating direction methodinexact solutionparallel splitting methodseparable convex optimization

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Convex programming (90C25)

Recommendations

• scientific article; zbMATH DE number 6453677
• A splitting method for separable convex programming
• Some parallel splitting methods for separable convex programming with the \(O(\frac{1}{t})\) convergence rate
• A partial inexact proximal point method for separable convex programming
• A partially parallel prediction-correction splitting method for convex optimization problems with separable structure

Cited in

(7)

• A partially parallel prediction-correction splitting method for convex optimization problems with separable structure
• An inexact Spingarn's partial inverse method with applications to operator splitting and composite optimization
• Fast inexact decomposition algorithms for large-scale separable convex optimization
• Iteration methods to compute the separable convex minimization problems
• Study on the Splitting Methods for Separable Convex Optimization in a Unified Algorithmic Framework
• The Primal-Dual Hybrid Gradient Method for Semiconvex Splittings
• scientific article; zbMATH DE number 6453677 (Why is no real title available?)

This page was built for publication: An inexact hybrid splitting method for separable convex optimization

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