Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities
From MaRDI portal
Publication:842770
DOI10.1007/s10589-007-9109-xzbMath1183.65080OpenAlexW2064704422MaRDI QIDQ842770
Publication date: 25 September 2009
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9109-x
Variational inequalities (49J40) Decomposition methods (49M27) Numerical methods for variational inequalities and related problems (65K15)
Related Items (53)
A new parallel splitting augmented Lagrangian-based method for a Stackelberg game ⋮ A parallel Gauss-Seidel method for convex problems with separable structure ⋮ A survey on some recent developments of alternating direction method of multipliers ⋮ On Full Jacobian Decomposition of the Augmented Lagrangian Method for Separable Convex Programming ⋮ An augmented Lagrangian based parallel splitting method for separable convex minimization with applications to image processing ⋮ Modified proximal symmetric ADMMs for multi-block separable convex optimization with linear constraints ⋮ On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM ⋮ A partially isochronous splitting algorithm for three-block separable convex minimization problems ⋮ On the \(O(1/t)\) convergence rate of the parallel descent-like method and parallel splitting augmented Lagrangian method for solving a class of variational inequalities ⋮ A new parallel splitting descent method for structured variational inequalities ⋮ A parallel splitting method for separable convex programs ⋮ A partial parallel splitting augmented Lagrangian method for solving constrained matrix optimization problems ⋮ TILT: transform invariant low-rank textures ⋮ Two convergent primal-dual hybrid gradient type methods for convex programming with linear constraints ⋮ An augmented Lagrangian-based parallel splitting method for a one-leader-two-follower game ⋮ Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure ⋮ An ADM-based splitting method for separable convex programming ⋮ Parallel multi-block ADMM with \(o(1/k)\) convergence ⋮ An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures ⋮ A new alternating projection-based prediction–correction method for structured variational inequalities ⋮ A self-adaptive descent LQP alternating direction method for the structured variational inequalities ⋮ On convergence analysis of a derivative-free trust region algorithm for constrained optimization with separable structure ⋮ On alternating direction method for solving variational inequality problems with separable structure ⋮ A partially proximal S-ADMM for separable convex optimization with linear constraints ⋮ An inexact alternating direction method for structured variational inequalities ⋮ A new descent alternating direction method with LQP regularization for the structured variational inequalities ⋮ Proximal-based pre-correction decomposition methods for structured convex minimization problems ⋮ Unnamed Item ⋮ A relaxed projection method for split variational inequalities ⋮ A descent SQP alternating direction method for minimizing the sum of three convex functions ⋮ A multi-parameter parallel ADMM for multi-block linearly constrained separable convex optimization ⋮ On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers ⋮ SQP alternating direction method with a new optimal step size for solving variational inequality problems with separable structure ⋮ TGV-based multiplicative noise removal approach: models and algorithms ⋮ An efficient simultaneous method for the constrained multiple-sets split feasibility problem ⋮ An inexact parallel splitting augmented Lagrangian method for large system of linear equations ⋮ Parallel LQP alternating direction method for solving variational inequality problems with separable structure ⋮ Learning latent variable Gaussian graphical model for biomolecular network with low sample complexity ⋮ A faster generalized ADMM-based algorithm using a sequential updating scheme with relaxed step sizes for multiple-block linearly constrained separable convex programming ⋮ New parallel descent-like method for solving a class of variational inequalities ⋮ A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA ⋮ A hybrid splitting method for smoothing Tikhonov regularization problem ⋮ A distributed Douglas-Rachford splitting method for multi-block convex minimization problems ⋮ A proximal alternating direction method for multi-block coupled convex optimization ⋮ A partial PPA block-wise ADMM for multi-block linearly constrained separable convex optimization ⋮ A new implementable prediction-correction method for monotone variational inequalities with separable structure ⋮ An alternating direction-based contraction method for linearly constrained separable convex programming problems ⋮ A partial inexact alternating direction method for structured variational inequalities ⋮ Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization ⋮ Total generalized variation restoration with non-quadratic fidelity ⋮ A new criterion for an inexact parallel splitting augmented Lagrangian method ⋮ An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems ⋮ The lower bound of nonlocal gradient for non-convex and non-smooth image patches based regularization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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 logarithmic-quadratic proximal method for variational inequalities
- A proximal-based deomposition method for compositions method for convex minimization problems
- Monotone Operators and the Proximal Point Algorithm
- Convergence of Proximal-Like Algorithms
- Finite-Dimensional Variational Inequalities and Complementarity Problems
This page was built for publication: Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities
