A partially parallel prediction-correction splitting method for convex optimization problems with separable structure

DOI10.1007/S40305-017-0163-5zbMath1386.90101OpenAlexW2608623632MaRDI QIDQ1689069

Fu-Sheng Bai, Ling Xu

Publication date: 12 January 2018

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-017-0163-5

zbMATH Keywords

block-separable convex optimizationextended alternating direction method of multipliersprediction-correction splitting method

Mathematics Subject Classification ID

Convex programming (90C25) Nonlinear programming (90C30)

Related Items (1)

A parallel Gauss-Seidel method for convex problems with separable structure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A note on the alternating direction method of multipliers
• An ADM-based splitting method for separable convex programming
• A partial splitting augmented Lagrangian method for low patch-rank image decomposition
• An alternating direction-based contraction method for linearly constrained separable convex programming problems
• Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
• Projection methods for variational inequalities with application to the traffic assignment problem
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• Convex analysis and monotone operator theory in Hilbert spaces

This page was built for publication: A partially parallel prediction-correction splitting method for convex optimization problems with separable structure