Investigation of path-following algorithms for signomial geometric programming problems

DOI10.1016/S0377-2217(96)00265-2MaRDI QIDQ1280139zbMATH OpenFDO

Authors Hsu-Hao Yang, Dennis Bricker

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)

Recommendations

• Global optimization of signomial geometric programming problems
• scientific article; zbMATH DE number 2161077
• A global optimization algorithm for signomial geometric programming problem
• Un nuevo algoritmo en programacion signomial
• A new algorithm for geometric programming based on the linear structure of its dual problem.

Cites work

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

Cited in

(12)

• Multiobjective geometric programming problem under uncertainty
• A global interior point method for nonconvex geometric programming
• The model and algorithm for the optimization of the granularity distribution
• A continuous strategy to solve a class of discrete optimization problems
• A tutorial on geometric programming
• On generalized geometric programming problems with non-positive variables
• Posynomial parametric geometric programming with interval valued coefficient
• Solving geometric programming problems with normal, linear and zigzag uncertainty distributions
• Posynomial geometric programming with parametric uncertainty
• A continuous strategy to solve a class of mixed optimization problems
• The discrete ellipsoid covering problem: a discrete geometric programming approach
• Investigation of path-following algorithms for signomial geometric programming problems

This page was built for publication: Investigation of path-following algorithms for signomial geometric programming problems

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