A descent SQP alternating direction method for minimizing the sum of three convex functions

DOI10.23952/JNVA.4.2020.3.10MaRDI QIDQ5152033zbMATH OpenOpenAlexFDO

Authors Abdellah Bnouhachem

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

zbMATH Keywords

alternating direction methodvariational inequalitiesprojection methodmonotone operatorsquare-quadratic proximal method

Mathematics Subject Classification ID

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)

Recommendations

• SQP alternating direction method for structured variational inequalities
• SQP alternating direction method with a new optimal step size for solving variational inequality problems with separable structure
• An inexact partial alternating direction method for convex programming problem
• Convergence of ADMM for Three-Block Separable Quadratic Programming Problems with Linear Constraints
• A new partial splitting augmented Lagrangian method for minimizing the sum of three convex functions

Cites work

• scientific article; zbMATH DE number 3574917 (Why is no real title available?)
• A descent LQP alternating direction method for solving variational inequality problems with separable structure
• A hybrid LQP-based method for structured variational inequalities
• A logarithmic-quadratic proximal method for variational inequalities
• A new parallel splitting descent method for structured variational inequalities
• A new partial splitting augmented Lagrangian method for minimizing the sum of three convex functions
• A partial parallel splitting augmented Lagrangian method for solving constrained matrix optimization problems
• A projection-based prediction-correction method for structured monotone variational inequalities
• An LQP-Based Decomposition Method for Solving a Class of Variational Inequalities
• An inexact LQP alternating direction method for solving a class of structured variational inequalities
• An inexact alternating direction method for solving a class of structured variational inequalities
• New parallel descent-like method for solving a class of variational inequalities
• On descent alternating direction method with LQP regularization for the structured variational inequalities
• On the \(O(1/t)\) convergence rate of alternating direction method with logarithmic-quadratic proximal regularization
• Parallel splitting augmented Lagrangian methods for monotone structured variational inequalities
• SQP alternating direction method for structured variational inequalities
• Strong convergence of a splitting algorithm for treating monotone operators

Cited in

(5)

• A linearized method for the separable convex programming with objective function represented as three functions
• Uniform treatment of Jensen's inequality by Montgomery identity
• An implicit algorithm for finding a fixed point of a \(Q\)-nonexpansive mapping in locally convex spaces
• Convergence of a distributed method for minimizing sum of convex functions with fixed point constraints
• scientific article; zbMATH DE number 7071979 (Why is no real title available?)

This page was built for publication: A descent SQP alternating direction method for minimizing the sum of three convex functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5152033)