- Title
- Solving DC programs using the cutting angle method
- Creator
- Ferrer, Albert; Bagirov, Adil; Beliakov, Gleb
- Date
- 2015
- Type
- Text; Journal article
- Identifier
- http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/92611
- Identifier
- vital:9608
- Identifier
-
https://doi.org/10.1007/s10898-014-0159-1
- Identifier
- ISSN:0925-5001
- Abstract
- 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.
- Publisher
- Springer
- Relation
- Journal of Global Optimization Vol. 61, no. 1 (2015), p. 71-89; http://purl.org/au-research/grants/arc/DP140103213
- Rights
- Copyright © Springer Science+Business Media New York 2014
- Rights
- This metadata is freely available under a CCO license
- Subject
- 0102 Applied Mathematics; 0103 Numerical and Computational Mathematics; 0802 Computation Theory and Mathematics; DC programming; Lipschitz programming; Cutting Angle method
- Reviewed
- Hits: 3279
- Visitors: 3180
- Downloads: 2
| Thumbnail | File | Description | Size | Format |
|---|