Optimization Online


A quasisecant method for minimizing nonsmooth functions

Adil Bagirov(a.bagirov***at***ballarat.edu.au)
Asef Nazari Ganjehlou(a.nazari***at***ballarat.edu.au)

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


Download: [PDF]

Entry Submitted: 03/09/2009
Entry Accepted: 03/10/2009
Entry Last Modified: 03/09/2009

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society