A preconditioning proximal newton method for nondifferentiable convex optimization

We propose a proximal Newton method for solving nondifferentiable convex optimization. This method combines the generalized Newton method with Rockafellar’s proximal point algorithm. At each step, the proximal point is found approximately and the regularization matrix is preconditioned to overcome inexactness of this approximation. We show that such a preconditioning is possible within some accuracy and the second-order differentiability properties of the Moreau-Yosida regularization are invariant with respect to this preconditioning. Based upon these, superlinear convergence is established under a semismoothness condition.

[1]  R. Tyrrell Rockafellar,et al.  Generalized Hessian Properties of Regularized Nonsmooth Functions , 1996, SIAM J. Optim..

[2]  Liqun Qi,et al.  An SQP algorithm for extended linear-quadratic problems in stochastic programming , 1995, Ann. Oper. Res..

[3]  Liqun Qi,et al.  Superlinearly convergent approximate Newton methods for LC1 optimization problems , 1994, Math. Program..

[4]  L. Qi,et al.  Newton's method for quadratic stochastic programs with recourse , 1995 .

[5]  Liqun Qi,et al.  Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations , 1993, Math. Oper. Res..

[6]  R. Rockafellar,et al.  Maximal monotone relations and the second derivatives of nonsmooth functions , 1985 .

[7]  Claude Lemaréchal,et al.  Practical Aspects of the Moreau-Yosida Regularization: Theoretical Preliminaries , 1997, SIAM J. Optim..

[8]  R. Poliquin,et al.  Second-Order Nonsmooth Analysis in Nonlinear Programming , 1995 .

[9]  Francisco Facchinei,et al.  Minimization of SC1 functions and the Maratos effect , 1995, Oper. Res. Lett..

[10]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[11]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[12]  Robert Mifflin,et al.  A quasi-second-order proximal bundle algorithm , 1996, Math. Program..

[13]  Masao Fukushima,et al.  A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization , 1996, SIAM J. Optim..

[14]  Masao Fukushima,et al.  A descent algorithm for nonsmooth convex optimization , 1984, Math. Program..

[15]  J. Pang,et al.  A globally convergent Newton method for convex SC1 minimization problems , 1995 .

[16]  F. Clarke.  Optimization And Nonsmooth Analysis , 1983 .

[17]  Liqun Qi,et al.  A nonsmooth version of Newton's method , 1993, Math. Program..

[18]  J. Hiriart-Urruty,et al.  Convex analysis and minimization algorithms , 1993 .

[19]  R. Tyrrell Rockafellar,et al.  Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming , 1976, Math. Oper. Res..

[20]  W. Murray.  Numerical Methods for Unconstrained Optimization , 1975 .