Local properties of algorithms for minimizing nonsmooth composite functions |
| |
Authors: | R S Womersley |
| |
Institution: | (1) School of Mathematics, University of New South Wales, P.O. Box 1, 2033 Kensington, N.S.W., Australia |
| |
Abstract: | This paper considers local convergence and rate of convergence results for algorithms for minimizing the composite functionF(x)=f(x)+h(c(x)) wheref andc are smooth buth(c) may be nonsmooth. Local convergence at a second order rate is established for the generalized Gauss—Newton method whenh is convex and globally Lipschitz and the minimizer is strongly unique. Local convergence at a second order rate is established for a generalized Newton method when the minimizer satisfies nondegeneracy, strict complementarity and second order sufficiency conditions. Assuming the minimizer satisfies these conditions, necessary and sufficient conditions for a superlinear rate of convergence for curvature approximating methods are established. Necessary and sufficient conditions for a two-step superlinear rate of convergence are also established when only reduced curvature information is available. All these local convergence and rate of convergence results are directly applicable to nonlinearing programming problems.This work was done while the author was a Research fellow at the Mathematical Sciences Research Centre, Australian National University. |
| |
Keywords: | Composite Functions Nonsmooth Optimization Structure Functionals Superlinear Convergence Second Order Convergence Strong Uniqueness Reduced Curvature |
本文献已被 SpringerLink 等数据库收录! |
|