Convergence analysis of a proximal point algorithm for minimizing differences of functions

Several optimization schemes have been known for convex optimization problems. However, numerical algorithms for solving nonconvex optimization problems are still underdeveloped. A significant progress to go beyond convexity was made by considering the class of functions representable as differences...

Full description

Bibliographic Details

Published in:	Optimization Vol. 66; no. 1; pp. 129 - 147
Main Authors:	An, Nguyen Thai, Nam, Nguyen Mau
Format:	Journal Article
Language:	English
Published:	Philadelphia Taylor & Francis 02.01.2017 Taylor & Francis LLC
Subjects:	Algorithms Computational geometry Convergence Convex analysis Convexity DC programming difference of convex functions Kurdyka-ᴌojasiewicz inequality Mathematical analysis Mathematical models Numerical analysis Optimization proximal point algorithm
ISSN:	0233-1934, 1029-4945
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!