Deakin University
Browse

File(s) under permanent embargo

Solving DC programs using the cutting angle method

journal contribution
posted on 2023-10-26, 04:19 authored by A Ferrer, A Bagirov, Gleb BeliakovGleb Beliakov
In this paper, we propose a new algorithm for global minimization of functions represented as a difference of two convex functions. The proposed method is a derivative free method and it is designed by adapting the extended cutting angle method. We present preliminary results of numerical experiments using test problems with difference of convex objective functions and box-constraints. We also compare the proposed algorithm with a classical one that uses prismatical subdivisions. © 2014 Springer Science+Business Media New York.

History

Journal

Journal of global optimization

Volume

61

Pagination

71-89

Location

New York, NY

ISSN

0925-5001

eISSN

1573-2916

Language

eng

Publication classification

C1 Refereed article in a scholarly journal, C Journal article

Copyright notice

2014, Springer

Publisher

Springer