首页 | 本学科首页   官方微博 | 高级检索  
     


Global minimization of a generalized convex multiplicative function
Authors:Hiroshi Konno  Takahito Kuno  Yasutoshi Yajima
Affiliation:(1) Institute of Human and Social Sciences, Tokyo Institute of Technology, Japan;(2) Institute of Information Sciences and Electronics, University of Tsukuba, Japan;(3) Department of Industrial Engineering and Management, Tokyo Institute of Technology, Japan
Abstract:This paper discusses an algorithm for generalized convex multiplicative programming problems, a special class of nonconvex minimization problems in which the objective function is expressed as a sum ofp products of two convex functions. It is shown that this problem can be reduced to a concave minimization problem with only 2p variables. An outer approximation algorithm is proposed for solving the resulting problem.
Keywords:Nonconvex minimization  global optimization  convex multiplicative function  outer approximation method
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号