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...
Saved in:
Main Authors: | Abdelouahed Hamdi, M. A. Noor, A. A. Mukheimer |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2012-01-01
|
Series: | Journal of Applied Mathematics |
Online Access: | http://dx.doi.org/10.1155/2012/142862 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
A modified proximal point algorithm for solving variational inclusion problem in real Hilbert spaces
by: Thierno M. M. Sow
Published: (2020-06-01) -
Iterative Algorithms for Solving the System of Mixed Equilibrium Problems, Fixed-Point Problems, and Variational Inclusions with Application to Minimization Problem
by: Tanom Chamnarnpan, et al.
Published: (2012-01-01) -
Strong Convergence Analysis of Iterative Algorithms for Solving Variational Inclusions and Fixed-Point Problems of Pseudocontractive Operators
by: Zhangsong Yao, et al.
Published: (2021-01-01) -
On the numerical solving of one minimization problem
by: Raimondas Čiegis, et al.
Published: (2002-12-01) -
Convergence of the High-Accuracy Algorithm for Solving the Dirichlet Problem of the Modified Helmholtz Equation
by: Hu Li, et al.
Published: (2020-01-01)