Some parallel splitting methods for separable convex programming with the O(1t) convergence rate

MaRDI QIDQ4979593zbMATH OpenFDO

Authors Min Tao

Publication date 23 June 2014

Full work available at URL http://www.yokohamapublishers.jp/online2/oppjo/vol10/p359.html

zbMATH Keywords

convex programmingparallel computationseparable structuresplitting methods

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• A splitting method for separable convex programming
• Fast multiple-splitting algorithms for convex optimization
• A parallel splitting method for separable convex programs
• A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA
• A proximal partially parallel splitting method for separable convex programs

Cited in

(15)

• A new parallel splitting augmented Lagrangian-based method for a Stackelberg game
• A simple parallel algorithm with an \(O(1/t)\) convergence rate for general convex programs
• An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
• scientific article; zbMATH DE number 6453677 (Why is no real title available?)
• On the convergence rate of the augmented Lagrangian-based parallel splitting method
• An inexact hybrid splitting method for separable convex optimization
• A splitting method for separable convex programming
• A proximal fully parallel splitting method with a relaxation factor for separable convex programming
• A parallel splitting method for separable convex programs
• A parallel splitting ALM-based algorithm for separable convex programming
• A survey on operator splitting and decomposition of convex programs
• A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA
• Fast multiple-splitting algorithms for convex optimization
• Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
• Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces

This page was built for publication: Some parallel splitting methods for separable convex programming with the \(O(\frac{1}{t})\) convergence rate

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