A short technical report claims Chen-Teboulle is the proximal point algorithm and derives a larger step-size bound, but the equivalence is contradicted by the paper's equations.
Moreau, Fonctions convexes duales et points proximaux dans un espace hilbertien, R
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
The Chen-Teboulle algorithm is the proximal point algorithm
A short technical report claims Chen-Teboulle is the proximal point algorithm and derives a larger step-size bound, but the equivalence is contradicted by the paper's equations.