Second order algorithms for the posynomial geometric programming dual, part I: Analysis
- 1 December 1979
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 17 (1) , 156-175
- https://doi.org/10.1007/bf01588241
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Large-scale linearly constrained optimizationMathematical Programming, 1978
- 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 modified concave simplex algorithm for geometric programmingJournal of Optimization Theory and Applications, 1975
- Newton-type methods for unconstrained and linearly constrained optimizationMathematical Programming, 1974
- An approach to the numerical solutions of geometric programsMathematical Programming, 1974
- Geometric Programming with Slack Constraints and Degrees of DifficultyA I I E Transactions, 1973
- A new method for the optimization of a nonlinear function subject to nonlinear constraintsThe Computer Journal, 1970