The developments of proximal point algorithms

DOI10.1007/s40305-021-00352-xzbMath1502.47081MaRDI QIDQ2158107

Deren Han, Kai Wang, Ke Guo, Fan Jiang, Zhongming Wu, Xing-Ju Cai

Publication date: 22 July 2022

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-021-00352-x

zbMATH Keywords

optimization; proximal point algorithms; Bregman distance; variational inequality problems; approximate criteria; zero-finding problems

Mathematics Subject Classification ID

90C25: Convex programming

90C26: Nonconvex programming, global optimization

47J20: Variational and other types of inequalities involving nonlinear operators (general)

65K10: Numerical optimization and variational techniques

49J52: Nonsmooth analysis

47H05: Monotone operators and generalizations

47J25: Iterative procedures involving nonlinear operators

47-02: Research exposition (monographs, survey articles) pertaining to operator theory

49M27: Decomposition methods

65K15: Numerical methods for variational inequalities and related problems