A second order affine scaling algorithm for the geometric programming dual with logarithmic barrier
- 1 January 1992
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 23 (4) , 303-322
- https://doi.org/10.1080/02331939208843767
Abstract
We present an interior point algorithm for solving the dual geometric programming problem, which avoids nondifferentiability at the boundary, yet uses singular Hessian information. The algorithm generates three sequences which converge, respectively, to optimal solutions for the primal and dual geometric programs, and to a Lagrangian dual solution of the dual geometric program. The sequences are connected by a robust procedure for converting duai GP solutions to primai GP solutions, and error bounds are given. Extensive computational experience is reported including solutions to GP problems having largest known degree of difficulty.Keywords
This publication has 24 references indexed in Scilit:
- Entropic meansJournal of Mathematical Analysis and Applications, 1989
- The role of duality in optimization problems involving entropy functionals with applications to information theoryJournal of Optimization Theory and Applications, 1988
- A Dual Approach to Multidimensional $L_p$ Spectral Estimation ProblemsSIAM Journal on Control and Optimization, 1988
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective methodMathematical Programming, 1986
- Projected Newton Methods for Optimization Problems with Simple ConstraintsSIAM Journal on Control and Optimization, 1982
- Second order algorithms for the posynomial geometric programming dual, part I: AnalysisMathematical Programming, 1979
- Dual to primal conversion in geometric programmingJournal of Optimization Theory and Applications, 1978
- Current state of the art of algorithms and computer software for geometric programmingJournal of Optimization Theory and Applications, 1978
- A set of geometric programming test problems and their solutionsMathematical Programming, 1976
- A modified concave simplex algorithm for geometric programmingJournal of Optimization Theory and Applications, 1975