A new convergence proof of augmented Lagrangian-based method with full Jacobian decomposition for structured variational inequalities

DOI10.3934/naco.2016.6.45zbMath1334.49090OpenAlexW2523945842MaRDI QIDQ5962805

Xi-Hong Yan

Publication date: 24 February 2016

Published in: Numerical Algebra, Control and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/naco.2016.6.45

zbMATH Keywords

convergencevariational inequalityaugmented Lagrangian-based methodJacobian decompositionseparable structure

Mathematics Subject Classification ID

Cites Work

• A note on augmented Lagrangian-based parallel splitting method
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
• 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
• Network economics: a variational inequality approach
• A note on the alternating direction method of multipliers
• A proximal parallel splitting method for minimizing sum of convex functions with linear constraints
• An alternating direction-based contraction method for linearly constrained separable convex programming problems
• Alternating Direction Method with Gaussian Back Substitution for Separable Convex Programming
• An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing
• On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming
• A splitting method for separable convex programming

This page was built for publication: A new convergence proof of augmented Lagrangian-based method with full Jacobian decomposition for structured variational inequalities