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

zbMATH Open1294.90046MaRDI QIDQ4979593FDOQ4979593

Authors: Min Tao 

Publication date: 23 June 2014

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

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

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)

Cited In (14)

• A parallel splitting method for separable convex programs
• Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces
• A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA
• 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
• Linearized alternating direction method with parallel splitting and adaptive penalty for separable convex programs in machine learning
• A parallel splitting ALM-based algorithm for separable convex programming
• On the convergence rate of the augmented Lagrangian-based parallel splitting method
• A splitting method for separable convex programming
• A survey on operator splitting and decomposition of convex programs
• An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
• Title not available (Why is that?)
• An inexact hybrid splitting method for separable convex optimization
• Fast multiple-splitting algorithms for convex optimization

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)