Optimization Online


A secant method for nonsmooth optimization

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

Abstract: The notion of a secant for locally Lipschitz continuous functions is introduced and a new algorithm to locally minimize nonsmooth, nonconvex functions based on secants is developed. We demonestrate that the secants can be used to design an algorithm to find descent directions of locally Lipschitz continuous functions. This algorithm is applied to design a minimization method, called a secant method. It is proved that the secant method generates a sequence converging to Clarke stationary points. Numerical results are presented demonstrating the applicability of the secant method 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, Lipschitz

Category 1: Convex and Nonsmooth Optimization (Nonsmooth Optimization )

Category 2: Convex and Nonsmooth Optimization


Download: [PDF]

Entry Submitted: 08/05/2007
Entry Accepted: 08/06/2007
Entry Last Modified: 08/05/2007

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