An interior-conjugate gradient mix-method for positive geometric programming

MaRDI QIDQ3400757zbMATH OpenFDO

Authors Shujie Jing, Zun-Quan Xia

Publication date 5 February 2010

zbMATH Keywords

global convergenceinterior penalty function method

Mathematics Subject Classification ID

Convexity of real functions of several variables, generalizations (26B25) Convex functions and convex programs in convex geometry (52A41) Convex programming (90C25) Nonlinear programming (90C30)

Recommendations

• Conjugate gradient method for unconstrained geometric programming
• Generalized gradient projection interior point algorithm for geometric programming
• A new linearization method for posynomial constrained generalized geometric programming
• An effective conjugate gradient algorithm for polynomial geometric programming
• scientific article; zbMATH DE number 5563572

Cited in

(3)

• An effective conjugate gradient algorithm for polynomial geometric programming
• Conjugate gradient method for unconstrained geometric programming
• Generalized gradient projection interior point algorithm for geometric programming

This page was built for publication: An interior-conjugate gradient mix-method for positive geometric programming

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