Deakin University
Browse

A quasisecant method for minimizing nonsmooth functions

Version 2 2024-06-04, 14:05
Version 1 2010-01-01, 00:00
journal contribution
posted on 2024-06-04, 14:05 authored by AM Bagirov, Asef NazariAsef Nazari
We present an algorithm to locally minimize nonsmooth, nonconvex functions. In order to find descent directions, the notion of quasisecants, introduced in this paper, is applied. We prove that the algorithm converges to Clarke stationary points. Numerical results are presented demonstrating the applicability of the proposed algorithm to a wide variety of nonsmooth, nonconvex optimization problems. We also compare the proposed algorithm with the bundle method using numerical results.

History

Related Materials

Location

London, Eng.

Language

eng

Publication classification

C1.1 Refereed article in a scholarly journal

Journal

Optimization Methods and Software

Volume

25

Pagination

3-18

ISSN

1055-6788

eISSN

1029-4937

Issue

1

Publisher

Taylor & Francis