✦ LIBER ✦

A new type of condensation curvilinear path algorithm for unconstrained generalized geometric programming

✍ Scribed by Yanjun Wang; Kecun Zhang; Peiping Shen

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 724 KB
Volume: 35
Category: Article
ISSN: 0895-7177
DOI: 10.1016/s0895-7177(02)00080-8

No coin nor oath required. For personal study only.

✦ Synopsis

new type of condensation curvilinear path algorithm is proposed for unconstrained generalized geometric programming (GGP). First, a new type of condensation problem is presented based on the special structure of GGP. Then a particular curvilinear path for the problem is constructed, along which we get the approximate solution of the problem within a trust region. It is proved that the method is globally convergent and that the convergence rate is quadratic. Numerical experiments are given to show the effectiveness and feasibility of the algorithm.