The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “A proximal point method for nonsmooth convex optimization problems in Banach spaces.”

Perturbed Proximal Point Algorithm with Nonquadratic Kernel

Brohe, M., Tossings, P. (2000)

Serdica Mathematical Journal

Similarity:

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...

Stability of Supporting and Exposing Elements of Convex Sets in Banach Spaces

Azé, D., Lucchetti, R. (1996)

Serdica Mathematical Journal

Similarity:

* This work was supported by the CNR while the author was visiting the University of Milan. To a convex set in a Banach space we associate a convex function (the separating function), whose subdifferential provides useful information on the nature of the supporting and exposed points of the convex set. These points are shown to be also connected to the solutions of a minimization problem involving the separating function. We investigate some relevant properties of this function...