An infeasible interior-point algorithm for solving primal and dual geometric programs
- 1 January 1997
- journal article
- Published by Springer Science and Business Media LLC in Mathematical Programming
- Vol. 76 (1), 155-181
- https://doi.org/10.1007/bf02614382
Abstract
No abstract availableKeywords
This publication has 25 references indexed in Scilit:
- A logarithmic barrier cutting plane method for convex programmingAnnals of Operations Research, 1995
- Restricted multinomial maximum likelihood estimation based upon Fenchel dualityStatistics & Probability Letters, 1994
- Experimental behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programmingDiscrete Applied Mathematics, 1994
- On the convergence of an infeasible primal-dual interior-point method for convex programmingOptimization Methods and Software, 1994
- Controlled dual perturbations for posynomial programsEuropean Journal of Operational Research, 1988
- Optimal design modifications by geometric programming and constrained stochastic network modelsInternational Journal of Systems Science, 1988
- Dual to primal conversion in 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
- Convex AnalysisPublished by Walter de Gruyter GmbH ,1970