Proximal-based pre-correction decomposition methods for structured convex minimization problems
type: Item
instance of: scholarly article
title: Proximal-based pre-correction decomposition methods for structured convex minimization problems
zbMATH Open document ID: 1307.90135
author: Yuanyuan Huang
author: Sanyang Liu
published in: Journal of the Operations Research Society of China
publication date: 2015-01-27T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 6391353
zbMATH Keywords: structured convex programming
zbMATH Keywords: parallel splitting
zbMATH Keywords: proximal point method
zbMATH Keywords: augmented Lagrangian
zbMATH Keywords: prediction-correction method
MaRDI profile type: Publication
full work available at URL: s40305-014-0042-2
OpenAlex ID: W2075261700
cites work: A proximal-based deomposition method for compositions method for convex minimization problems
cites work: Application of the alternating direction method of multipliers to separable convex programming problems
cites work: Q4144736
cites work: A dual algorithm for the solution of nonlinear variational problems via finite element approximation
cites work: Fast alternating linearization methods for minimizing the sum of two convex functions
cites work: Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities
cites work: An alternating direction-based contraction method for linearly constrained separable convex programming problems
cites work: Q5491447
cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
cites work: On the Maximality of Sums of Nonlinear Monotone Operators
cites work: Q5665783
cites work: Q3857336
DOI: 10.1007/S40305-014-0042-2
Recommended article: A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
Recommended article: Approximations in proximal bundle methods and decomposition of convex programs
Recommended article: Proximal alternating directions method for structured variational inequalities
Recommended article: Degenerate Preconditioned Proximal Point Algorithms
Recommended article: A proximal-based deomposition method for compositions method for convex minimization problems
Recommended article: Nonlinear proximal decomposition method for convex programming
Recommended article: Primal-dual proximal algorithms for structured convex optimization: a unifying framework
Recommended article: A proximal multiplier method for separable convex minimization
Recommended article: Q5702611
Recommended article: An inexact proximal decomposition method for variational inequalities with separable structure
description: scientific article; zbMATH DE number 6391353