2ND-ORDER ALGORITHMS FOR THE POSYNOMIAL GEOMETRIC-PROGRAMMING DUAL .1. ANALYSIS

被引：3

作者：

DEMBO, RS

机构：

[1] Yale University, New Haven, Conn.

来源：

MATHEMATICAL PROGRAMMING | 1979年 / 17卷 / 02期

关键词：

Geometric Programming Algorithms; Nonlinear Programming; Second-Order Methods;

D O I：

10.1007/BF01588241

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

In this paper we analyse algorithms for the geometric dual of posynomial programming problems, that make explicit use of second order information. Out of two possible approaches to the problem, it is shown that one is almost always superior. Interestingly enough, it is the second, inferior approach that has dominated the geometric programming literature. © 1979 North-Holland Publishing Company.

引用

页码：156 / 175

页数：20

共 21 条

[1]

[Anonymous], INTEGER NONLINEAR PR

[2] MODIFIED CONCAVE SIMPLEX ALGORITHM FOR GEOMETRIC PROGRAMMING [J].