AbstractIn this work, a theoretical analysis of proximal point methods is done for solving nonconvex optimization problems and more specifically DC programming problems. The aim is to study convergence properties of an approximate proximal point algorithm for minimizing DC functions and to suggest an algorithmic scheme for computing the proximal point. The method used in this work is the bundle method well-known in convex optimization. Our analysis also allows us to consider the exact scheme.
|Date of Award||2006|
|Supervisor||Jean-Jacques STRODIOT (Supervisor), Van Hien Nguyen (Jury) & Frank CALLIER (Jury)|