Proximal-based pre-correction decomposition methods for structured convex minimization problems

DOI10.1007/s40305-014-0042-2zbMath1307.90135OpenAlexW2075261700MaRDI QIDQ489115

San-Yang Liu, Yuan-Yuan Huang

Publication date: 27 January 2015

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-014-0042-2

zbMATH Keywords

augmented Lagrangianprediction-correction methodproximal point methodparallel splittingstructured convex programming

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (1)

A homotopy alternating direction method of multipliers for linearly constrained separable convex optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast alternating linearization methods for minimizing the sum of two convex functions
• Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities
• Application of the alternating direction method of multipliers to separable convex programming problems
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• A proximal-based deomposition method for compositions method for convex minimization problems
• An alternating direction-based contraction method for linearly constrained separable convex programming problems
• Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
• On the Maximality of Sums of Nonlinear Monotone Operators

This page was built for publication: Proximal-based pre-correction decomposition methods for structured convex minimization problems