Show simple item record

AuthorBnouhachem, Abdellah
AuthorHamdi, Abdelouahed
AuthorXu, M. H.
Available date2021-04-01T12:34:18Z
Publication Date2016
Publication NameOptimization
ResourceScopus
URIhttp://dx.doi.org/10.1080/02331934.2016.1244534
URIhttp://hdl.handle.net/10576/18087
AbstractWe presented a new logarithmic-quadratic proximal alternating direction scheme for the separable constrained convex programming problem. The predictor is obtained by solving series of related systems of non-linear equations in a parallel wise. The new iterate is obtained by searching the optimal step size along a new descent direction. The new direction is obtained by the linear combination of two descent directions. Global convergence of the proposed method is proved under certain assumptions. We show the O(1�/�t) convergence rate for the parallel LQP alternating direction method.
Languageen
PublisherTaylor and Francis Ltd.
Subjectalternating direction method; convergence rate; logarithmic-quadratic proximal method; monotone operator; projection method; Variational inequalities
TitleA new LQP alternating direction method for solving variational inequality problems with separable structure
TypeArticle
Pagination2251-2267
Issue Number12
Volume Number65
dc.accessType Abstract Only


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record