Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities
From MaRDI portal
The author explains a complete justification for presenting a parallel splitting augmented Lagrangian method. The proposed method is extended to solve a system of equilibrium problems with three separable variables. Also the author justifies why the same technique cannot be used to develop similar methods for problems with more than three separable operators.
Recommendations
- An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures
- A new inexact parallel splitting method for monotone variational inequalities with separable structures
- 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
- An inexact parallel alternating direction method for structured variational inequalities
- An augmented Lagrangian-based parallel splitting method for a one-leader-two-follower game
Cites work
- 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
- Application of the alternating direction method of multipliers to separable convex programming problems
- Convergence of Proximal-Like Algorithms
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- scientific article; zbMATH DE number 3852340 (Why is no real title available?)
- scientific article; zbMATH DE number 45081 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- Monotone Operators and the Proximal Point Algorithm
Cited in
(59)- A partially isochronous splitting algorithm for three-block separable convex minimization problems
- Parallel multi-block ADMM with \(o(1/k)\) convergence
- A new descent alternating direction method with LQP regularization for the structured variational inequalities
- TGV-based multiplicative noise removal approach: models and algorithms
- TILT: transform invariant low-rank textures
- An ADM-based splitting method for separable convex programming
- 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
- An efficient partial parallel method with scaling step size strategy for three-block convex optimization problems
- A survey on some recent developments of alternating direction method of multipliers
- A self-adaptive descent LQP alternating direction method for the structured variational inequalities
- A partially proximal S-ADMM for separable convex optimization with linear constraints
- A multi-parameter parallel ADMM for multi-block linearly constrained separable convex optimization
- Parallel LQP alternating direction method for solving variational inequality problems with separable structure
- A proximal alternating direction method for multi-block coupled convex optimization
- A new implementable prediction-correction method for monotone variational inequalities with separable structure
- A new criterion for an inexact parallel splitting augmented Lagrangian method
- On the proximal Jacobian decomposition of ALM for multiple-block separable convex minimization problems and its relationship to ADMM
- A new parallel splitting augmented Lagrangian-based method for a Stackelberg game
- Convergence analysis of an ALF-based nonconvex splitting algorithm with SQP structure
- An alternating direction-based contraction method for linearly constrained separable convex programming problems
- 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
- 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
- An inexact parallel splitting augmented Lagrangian method for monotone variational inequalities with separable structures
- On alternating direction method for solving variational inequality problems with separable structure
- On convergence analysis of a derivative-free trust region algorithm for constrained optimization with separable structure
- An inexact alternating direction method for structured variational inequalities
- Proximal-based pre-correction decomposition methods for structured convex minimization problems
- A relaxed projection method for split variational inequalities
- A partial PPA block-wise ADMM for multi-block linearly constrained separable convex optimization
- The lower bound of nonlocal gradient for non-convex and non-smooth image patches based regularization
- scientific article; zbMATH DE number 7599681 (Why is no real title available?)
- On the \(O(1/t)\) convergence rate of Ye-Yuan's modified alternating direction method of multipliers
- Modified proximal symmetric ADMMs for multi-block separable convex optimization with linear constraints
- A descent SQP alternating direction method for minimizing the sum of three convex functions
- SQP alternating direction method with a new optimal step size for solving variational inequality problems with separable structure
- A new partial parallel splitting method for monotone variational inequalities
- A new alternating projection-based prediction-correction method for structured variational inequalities
- A partial inexact alternating direction method for structured 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
- Two convergent primal-dual hybrid gradient type methods for convex programming with linear constraints
- A partial parallel splitting augmented Lagrangian method for solving constrained matrix optimization problems
- A half-proximal symmetric splitting method for non-convex separable optimization
- Revisiting parallel splitting augmented Lagrangian method: tight convergence and ergodic convergence rate
- An efficient simultaneous method for the constrained multiple-sets split feasibility problem
- The Inexact Parallel Splitting Augmented Lagrangian Algorithm for Multistage Stochastic Variational Inequalities
- Research on the convergence rate of Bregman ADMM for nonconvex multiblock optimization
- A distributed method hybridizing fully symmetric Peaceman-Rachford regularization with sequential quadratic programming for nonconvex-nonsmooth multi-block optimization
- Two new customized proximal point algorithms without relaxation for linearly constrained convex optimization
- Total generalized variation restoration with non-quadratic fidelity
- A parallel Gauss-Seidel method for convex problems with separable structure
- An augmented Lagrangian-based parallel splitting method for a one-leader-two-follower game
- An inexact parallel splitting augmented Lagrangian method for large system of linear equations
- New parallel descent-like method for solving a class of variational inequalities
This page was built for publication: Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q842770)
