Investigation of path-following algorithms for signomial geometric programming problems

DOI10.1016/S0377-2217(96)00265-2zbMath0922.90117MaRDI QIDQ1280139

Dennis L. Bricker, Hsu-Hao Yang

Publication date: 19 October 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

interior point methodspath-followingsignomial geometric programmingnonconvex nonlinear programming

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

A Continuous Strategy to Solve a Class of Discrete Optimization Problems ⋮ The model and algorithm for the optimization of the granularity distribution ⋮ On generalized geometric programming problems with non-positive variables ⋮ Solving geometric programming problems with normal, linear and zigzag uncertainty distributions ⋮ A continuous strategy to solve a class of mixed optimization problems ⋮ The discrete ellipsoid covering problem: a discrete geometric programming approach ⋮ Posynomial parametric geometric programming with interval valued coefficient ⋮ Unnamed Item ⋮ A tutorial on geometric programming ⋮ Investigation of path-following algorithms for signomial geometric programming problems ⋮ Posynomial geometric programming with parametric uncertainty

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Comparison of a special-purpose algorithm with general-purpose algorithms for solving geometric programming problems
• Interior path following primal-dual algorithms. II: Convex quadratic programming
• An interior point algorithm to solve computationally difficult set covering problems
• An interior point potential reduction algorithm for the linear complementarity problem
• Comparison of generalized geometric programming algorithms
• Solving geometric programs using GRG: Results and comparisons
• Current state of the art of algorithms and computer software for geometric programming
• Investigation of path-following algorithms for signomial geometric programming problems
• Constrained maximization of posynomials by geometric programming
• Complementary Geometric Programming
• A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
• A Polynomial Barrier Algorithm for Linearly Constrained Convex Programming Problems
• Generalized Polynomial Optimization
• Generalized Weighted Mean Programming
• Computational procedures for the maximum likelihood parameters of the gamma and beta distributions