返回
Global optimization in generalized geometric programming
DOI:10.1016/S0098-1354(96)00282-7.png)
摘要
En 中文
A deterministic global optimization algorithm is proposed for locating the global minimum of generalized geometric (signomial) problems (GGP). By utilizing an exponential variable transformation the initial nonconvex problem (GGP) is reduced to a (DC) programming problem where both the constraints and the objective are decomposed into the difference of two convex functions. A convex relaxation of problem (DC) is then obtained based on the linear lower bounding of the concave parts of the objective function and constraints inside some box region. The proposed branch and bound type algorithm attains finite E-convergence to the global minimum through the successive refinement of a convex relaxation of the feasible region and/or of the objective function and the subsequent solution of a series of nonlinear convex optimization problems. The efficiency of the proposed approach is enhanced by eliminating variables through monotonicity analysis, by maintaining tightly bound variables through rescaling, by further improving the supplied variable bounds through convex minimization, and finally by transforming each inequality constraint so as the concave part lower bounding is as tight as possible. The proposed approach is illustrated with a large number of test examples and robust stability analysis problems. Copyright (C) 1996 Elsevier Science Ltd
Keyword:
global optimization
generalized geometric programming
signomials
robust stability analysis
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.9
论文数:
8.1K
被引数:
1.7W
机构
暂无机构信息
引用论文
Overweight Prevalence among Rural Adolescents by Household Head Obesity and Socio-Economic Status in Limpopo, South Africa南非林波波省农村青少年超重患病率:基于户主肥胖和社会经济地位的调查
Children
IF0

