Journal article
A Second Order Affine Scaling Algorithm for the Geometric Programming Dual with Logarithmic Barrier
Optimization, Vol.23(4), pp.303-322
01/01/1992
DOI: 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.
Details
- Title: Subtitle
- A Second Order Affine Scaling Algorithm for the Geometric Programming Dual with Logarithmic Barrier
- Creators
- K. O. Kortanek - University of IowaHoon No - Korea Institute for Defense Analysis, South Korea
- Resource Type
- Journal article
- Publication Details
- Optimization, Vol.23(4), pp.303-322
- DOI
- 10.1080/02331939208843767
- ISSN
- 0233-1934
- eISSN
- 1029-4945
- Number of pages
- 20
- Language
- English
- Date published
- 01/01/1992
- Academic Unit
- Business Analytics
- Record Identifier
- 9984963116802771
Metrics
1 Record Views