To access the full text documents, please follow this link:

Solving DC programs using the cutting angle method
Ferrer Biosca, Alberto; Bagirov, Adil; Beliakov, Gleb
Universitat Politècnica de Catalunya. Departament de Matemàtica Aplicada I; Universitat Politècnica de Catalunya. GNOM - Grup d´Optimització Numèrica i Modelització
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.
Peer Reviewed
Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa
Operations research
DC programming
Lipschitz programming
Cutting Angle method
Investigació operativa
Attribution-NonCommercial-NoDerivs 3.0 Spain

Show full item record

Related documents

Other documents of the same author

Ionescu, Dragos; Juan Pérez, Angel Alejandro; Faulín, Javier; Ferrer Biosca, Alberto
Auslander, Alfred; Ferrer Biosca, Alberto; Goberna, Miguel Ángel; López Cerdá, Marco Antonio
Juan Pérez, Angel Alejandro; Monteforte, A.; Ferrer Biosca, Alberto; Serrat Piè, Carles; Faulín, Javier
Juan Pérez, Angel Alejandro; Ferrer Biosca, Alberto; Serrat Piè, Carles; Faulín, Javier; Hester, J.; López Brosa, Pere