The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Let H be a real Hilbert space and T be a maximal monotone
operator on H.
A well-known algorithm, developed by R. T. Rockafellar [16], for solving
the problem
(P) ”To find x ∈ H such that 0 ∈ T x”
is the proximal point algorithm.
Several generalizations have been considered by several authors: introduction
of a perturbation, introduction of a variable metric in the perturbed
algorithm, introduction of a pseudo-metric in place of the classical regularization,
. . .
We summarize some of these extensions...
Download Results (CSV)