Geodesic
On the Cutting Plane Property and the Bregman Proximal Point Algorithm
Journal of convex analysis, Tome 18 (2011) no. 3, pp. 601-619.

Voir la notice de l'article provenant de la source Heldermann Verlag

The Bregman-function-based Proximal Point Algorithm (BPPA) for solving variational inequalities is considered. In this framework the customary assumption of the cutting plane property (CPP) of the related operator is investigated. Since this property cannot be expected in saddle-point-problems, it should be considered as rather restrictive. This paper contributes to the situation when the CPP fails to hold. For this situation, interior proximal(-like) methods have only been constructed for polyhedral sets up to now. 
@article{JCA_2011_18_3_JCA_2011_18_3_a0,
     author = {N. Langenberg},
     title = {On the {Cutting} {Plane} {Property} and the {Bregman} {Proximal} {Point} {Algorithm}},
     journal = {Journal of convex analysis},
     pages = {601--619},
     publisher = {mathdoc},
     volume = {18},
     number = {3},
     year = {2011},
     url = {http://geodesic.mathdoc.fr/item/JCA_2011_18_3_JCA_2011_18_3_a0/}
}
TY  - JOUR
AU  - N. Langenberg
TI  - On the Cutting Plane Property and the Bregman Proximal Point Algorithm
JO  - Journal of convex analysis
PY  - 2011
SP  - 601
EP  - 619
VL  - 18
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/JCA_2011_18_3_JCA_2011_18_3_a0/
ID  - JCA_2011_18_3_JCA_2011_18_3_a0
ER  - 
%0 Journal Article
%A N. Langenberg
%T On the Cutting Plane Property and the Bregman Proximal Point Algorithm
%J Journal of convex analysis
%D 2011
%P 601-619
%V 18
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/JCA_2011_18_3_JCA_2011_18_3_a0/
%F JCA_2011_18_3_JCA_2011_18_3_a0
N. Langenberg. On the Cutting Plane Property and the Bregman Proximal Point Algorithm. Journal of convex analysis, Tome 18 (2011) no. 3, pp. 601-619. http://geodesic.mathdoc.fr/item/JCA_2011_18_3_JCA_2011_18_3_a0/