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

Title:
A new type of condensation curvilinear path algorithm for unconstrained generalized geometric programming
Source:
Mathematical and computer modelling. 35(11-12):1209-1219
Publisher Information:
Oxford: Elsevier Science, 2002.
Publication Year:
2002
Physical Description:
print, 11 ref
Original Material:
INIST-CNRS
Document Type:
Academic journal Article
File Description:
text
Language:
English
Author Affiliations:
School of Science, Xi'an Jiaotong University, Xi'an, China
ISSN:
0895-7177
Rights:
Copyright 2002 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Mathematics

Operational research. Management
Accession Number:
edscal.13694648
Database:
PASCAL Archive

Further Information

A 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.