A new algorithm for signomial geometric programming without constraints

MaRDI QIDQ2780879zbMATH OpenFDO

Authors Kecun Zhang, Yanjun Wang

Publication date 14 March 2002

Published in Numerical Mathematics (Search for Journal in Brave)

zbMATH Keywords

convergencesignomial geometric programmingtrust-region algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)

Review text

In the light of trust-region algorithm, this paper proposes an algorithm for unconstrained signomial geometric programming. Global convergence and local quadratic convergence of the algorithm are established.

Cited in

(2)

• scientific article; zbMATH DE number 5169224 (Why is no real title available?)
• scientific article; zbMATH DE number 5209759 (Why is no real title available?)

This page was built for publication: A new algorithm for signomial geometric programming without constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2780879)