Please use this identifier to cite or link to this item:
Type: Artigo de periódico
Title: A convex analysis approach for convex multiplicative programming
Author: Oliveira, RM
Ferreira, PAV
Abstract: Global optimization problems involving the minimization of a product of convex functions on a convex set are addressed in this paper. Elements of convex analysis are used to obtain a suitable representation of the convex multiplicative problem in the outcome space, where its global solution is reduced to the solution of a sequence of quasiconcave minimizations on polytopes. Computational experiments illustrate the performance of the global optimization algorithm proposed.
Subject: global optimization
multiplicative programming
convex analysis
numerical methods
Country: Holanda
Editor: Springer
Rights: fechado
Identifier DOI: 10.1007/s10898-007-9267-5
Date Issue: 2008
Appears in Collections:Unicamp - Artigos e Outros Documentos

Files in This Item:
File Description SizeFormat 
WOS000256964200005.pdf200.32 kBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.