Convergence of a Proximal Point Algorithm for Solving Minimization Problems
We introduce and consider a proximal point algorithm for solving minimization problems using the technique of Güler. This proximal point algorithm is obtained by substituting the usual quadratic proximal term by a class of convex nonquadratic distance-like functions. It can be seen as an extragradie...
Main Authors: | Abdelouahed Hamdi, M. A. Noor, A. A. Mukheimer |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2012-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2012/142862 |
Similar Items
-
Modified Lagrangian Methods for Separable Optimization Problems
by: Abdelouahed Hamdi, et al.
Published: (2012-01-01) -
Δ-convergence for proximal point algorithm and fixed point problem in CAT(0) spaces
by: Shamshad Husain, et al.
Published: (2019-05-01) -
Convergence Analysis of the Relaxed Proximal Point Algorithm
by: Min Li, et al.
Published: (2013-01-01) -
MODIFIED PROXIMAL POINT ALGORITHM FOR MINIMIZATION AND FIXED POINT PROBLEM IN CAT(0) SPACES
by: Godwin Chidi Ugwunnadi
Published: (2021-07-01) -
Convergence Analysis on an Accelerated Proximal Point Algorithm for Linearly Constrained Optimization Problems
by: Sha Lu, et al.
Published: (2020-01-01)