A descent SQP alternating direction method for minimizing the sum of three convex functions
DOI10.23952/jnva.4.2020.3.10zbMath1470.65120OpenAlexW4241420265MaRDI QIDQ5152033
Publication date: 18 February 2021
Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.23952/jnva.4.2020.3.10
variational inequalitiesmonotone operatorprojection methodalternating direction methodsquare-quadratic proximal method
Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Numerical methods for variational inequalities and related problems (65K15)
Related Items (3)
Cites Work
- A descent LQP alternating direction method for solving variational inequality problems with separable structure
- An inexact LQP alternating direction method for solving a class of structured variational inequalities
- A new parallel splitting descent method for structured variational inequalities
- A partial parallel splitting augmented Lagrangian method for solving constrained matrix optimization problems
- Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities
- A projection-based prediction-correction method for structured monotone variational inequalities
- New parallel descent-like method for solving a class of variational inequalities
- A logarithmic-quadratic proximal method for variational inequalities
- On descent alternating direction method with LQP regularization for the structured variational inequalities
- Strong convergence of a splitting algorithm for treating monotone operators
- A new partial splitting augmented Lagrangian method for minimizing the sum of three convex functions
- An inexact alternating direction method for solving a class of structured variational inequalities
- An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities
- A hybrid LQP-based method for structured variational inequalities
- On the $O(1/t)$ Convergence Rate of Alternating Direction Method with Logarithmic-Quadratic Proximal Regularization
- Unnamed Item
- Unnamed Item
This page was built for publication: A descent SQP alternating direction method for minimizing the sum of three convex functions