Title
Self-adaptive inexact proximal point methods
Abstract
We propose a class of self-adaptive proximal point methods suitable for degenerate optimization problems where multiple minimizers may exist, or where the Hessian may be singular at a local minimizer. If the proximal regularization parameter has the form $\mu({\bf{x}})=\beta\|\nabla f({\bf{x}})\|^{\eta}$ where 驴驴[0,2) and β0 is a constant, we obtain convergence to the set of minimizers that is linear for 驴=0 and β sufficiently small, superlinear for 驴驴(0,1), and at least quadratic for 驴驴[1,2). Two different acceptance criteria for an approximate solution to the proximal problem are analyzed. These criteria are expressed in terms of the gradient of the proximal function, the gradient of the original function, and the iteration difference. With either acceptance criterion, the convergence results are analogous to those of the exact iterates. Preliminary numerical results are presented using some ill-conditioned CUTE test problems.
Year
DOI
Venue
2008
10.1007/s10589-007-9067-3
Comp. Opt. and Appl.
Keywords
Field
DocType
Proximal point,Degenerate optimization,Multiple minima,Self-adaptive method
Convergence (routing),Degenerate energy levels,Nabla symbol,Mathematical optimization,Combinatorics,Mathematical analysis,Quadratic equation,Hessian matrix,Proximal Gradient Methods,Regularization (mathematics),Iterated function,Mathematics
Journal
Volume
Issue
ISSN
39
2
0926-6003
Citations 
PageRank 
References 
12
0.73
11
Authors
2
Name
Order
Citations
PageRank
William W. Hager11603214.67
Hongchao Zhang280943.29