Infeasible interior-point algorithm based optimization method for geometric programming

MaRDI QIDQ2704889zbMATH OpenFDO

Authors Qiang Liu, Xiaoming Xu, Weidong Zhang

Publication date 8 July 2001

Published in Journal of Shanghai Jiaotong University (Chinese Edition) (Search for Journal in Brave)

zbMATH Keywords

geometric programminginterior point algorithmpath-following algorithmposynomial primal and dual geometric programsprimal-dual infeasible algorithm

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46)

Recommendations

• An infeasible interior-point algorithm for solving primal and dual geometric programs
• 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
• scientific article; zbMATH DE number 1744789
• scientific article; zbMATH DE number 3871044

Cited in

(14)

• A primal-dual Newton-type algorithm for geometric programs with equality constraints
• An infeasible interior-point algorithm for solving primal and dual geometric programs
• A new algorithm for geometric programming based on the linear structure of its dual problem.
• scientific article; zbMATH DE number 4014471 (Why is no real title available?)
• scientific article; zbMATH DE number 3871044 (Why is no real title available?)
• scientific article; zbMATH DE number 3871066 (Why is no real title available?)
• scientific article; zbMATH DE number 4211815 (Why is no real title available?)
• A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
• scientific article; zbMATH DE number 1744789 (Why is no real title available?)
• scientific article; zbMATH DE number 934402 (Why is no real title available?)
• Solving posynomial geometric programming problems via generalized linear programming
• A global interior point method for nonconvex geometric programming
• A comparison between a primal and a dual cutting plane algorithm for posynomial geometric programming problems
• A general algorithm for solving generalized geometric programming with nonpositive degree of difficulty

This page was built for publication: Infeasible interior-point algorithm based optimization method for geometric programming

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