39 research outputs found
On the O ( 1 / t ) convergence rate of the alternating direction method with LQP regularization for solving structured variational inequality problems
Get PDFParallel LQP alternating direction method for solving variational inequality problems with separable structure
Get PDF
The common solution for a generalized equilibrium problem, a variational inequality problem and a hierarchical fixed point problem
Get PDF
Algorithms of common solutions for a variational inequality, a split equilibrium problem and a hierarchical fixed point problem
Get PDFShrinking projection methods for solving split equilibrium problems and fixed point problems for asymptotically nonexpansive mappings in Hilbert spaces
Get PDFEntropy-Like Minimization Methods Based on Modified Proximal Point Algorithm
No full textIn this paper we introduce an extension of the proximal point algorithm proposed by Guler for solving convex minimization problems. This extension is obtained by substituting the usual quadratic proximal term by a class of convex nonquadratic entropy-like distances, called ?Ó-divergences. A study of the convergence rate of this new proximal point method under mild assumptions is given, and further it is shown that this estimate rate is better than the available one of proximal-like methods. Some applications are given concerning general convex minimizations, linearly constrained convex programs and variationnal inequalities. 2015 INFOR Journal.Scopu
