A quasisecant method for minimizing nonsmooth functions
Abstract: In this paper a new algorithm to locally minimize nonsmooth, nonconvex functions is developed. We introduce the notion of secants and quasisecants for nonsmooth functions. The quasisecants are applied to find descent directions of locally Lipschitz functions. We design a minimization algorithm which uses quasisecants to find descent directions. We prove that this algorithm converges to Clarke stationary points. Numerical results are presented demonstrating the applicability of the proposed algorithm in wide variety of nonsmooth, nonconvex optimization problems. We also, compare the proposed algorithm with the bundle method using numerical results.
Keywords: nonsmooth optimization, nonconvex optimization, subdifferential, bundle method.
Category 1: Convex and Nonsmooth Optimization (Nonsmooth Optimization )
Category 2: Nonlinear Optimization
Entry Submitted: 03/09/2009
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|