An effective conjugate gradient algorithm for polynomial geometric programming

DOI10.3969/J.ISSN.1673-5862.2011.02.004MaRDI QIDQ2917851zbMATH OpenFDO

Authors Xianglian Cao, Shuzhen Zheng, Can Li

Publication date 5 October 2012

Published in Journal of Shenyang Normal University. Natural Science Edition (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3969/J.ISSN.1673-5862.2011.02.004

zbMATH Keywords

global convergenceconjugate gradient methodpolynomial geometric programming

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• Conjugate gradient method for unconstrained geometric programming
• An interior-conjugate gradient mix-method for positive geometric programming
• A nonmonotone conjugate gradient algorithm for unconstrained optimization
• A new conjugate gradient method for unconstrained optimization
• Two new conjugate gradient methods for unconstrained optimization

Cited in

(3)

• Conjugate gradient method for unconstrained geometric programming
• An interior-conjugate gradient mix-method for positive geometric programming
• scientific article; zbMATH DE number 3984992 (Why is no real title available?)

This page was built for publication: An effective conjugate gradient algorithm for polynomial geometric programming

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