An LS-free splitting method for composite mappings
This paper gives a new splitting method for variational inclusion of the form \(0 \in A^TTA(x)\), where \(A\) is an \(m \times n \) matrix, \(T:R^m \rightrightarrows R^m\) is a maximal monotone mapping, and \(A^T\) denotes the transpose of \(A\). Compared with Pennanen's recently proposed method [\textit{T. Pennanen}, Numer. Funct. Anal. Optimization 23, No.~7--8, 875--890 (2002; Zbl 1054.49022)], our new scheme is free of the least squares subproblem at each iteration. Its global convergence is proven under maximal monotonicity of \(T\) and the existence of a solution.
- An extension of Luque's growth condition
- On globally Q-linear convergence of a splitting method for group Lasso
- Weak convergence of an extended splitting method for monotone inclusions
- Asymmetric forward-backward-adjoint splitting for solving monotone inclusions involving three operators
- Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions
- A variable metric proximal-descent algorithm for monotone operators
- A SPLITTING METHOD FOR COMPOSITE MAPPINGS
- The geometry of monotone operator splitting methods
- Two new splitting methods for three-operator monotone inclusions in Hilbert spaces
- A new splitting method for monotone inclusions of three operators
- A fully relaxed Tseng's splitting method
This page was built for publication: An LS-free splitting method for composite mappings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q812754)