Generalized gradient projection interior point algorithm for geometric programming

MaRDI QIDQ3405350zbMATH OpenFDO

Authors Shujie Jing, Yazheng Dang, Kecun Zhang

Publication date 12 February 2010

zbMATH Keywords

geometric programminginterior point algorithmdual theorygeneralized gradient projection

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5563572
• A generalized variable metric projection algorithm for geometric programming
• An interior-conjugate gradient mix-method for positive geometric programming
• A new algorithm for geometric programming based on the linear structure of its dual problem.
• A new linearization method for posynomial constrained generalized geometric programming

Cited in

(9)

• scientific article; zbMATH DE number 5563572 (Why is no real title available?)
• A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty
• Conjugate gradient method for unconstrained geometric programming
• An interior-conjugate gradient mix-method for positive geometric programming
• A generalized variable metric projection algorithm for geometric programming
• A new type of condensation curvilinear path algorithm for unconstrained generalized geometric programming
• A new algorithm for geometric programming based on the linear structure of its dual problem.
• A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
• Frank-Wolfe algorithm to a certain kind of geometric programming

This page was built for publication: Generalized gradient projection interior point algorithm for geometric programming

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