An infeasible interior-point algorithm for solving primal and dual geometric programs

This publication has 25 references indexed in Scilit:

• A logarithmic barrier cutting plane method for convex programming
  Annals of Operations Research, 1995
• Restricted multinomial maximum likelihood estimation based upon Fenchel duality
  Statistics & Probability Letters, 1994
• Experimental behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programming
  Discrete Applied Mathematics, 1994
• On the convergence of an infeasible primal-dual interior-point method for convex programming
  Optimization Methods and Software, 1994
• Controlled dual perturbations for posynomial programs
  European Journal of Operational Research, 1988
• Optimal design modifications by geometric programming and constrained stochastic network models
  International Journal of Systems Science, 1988
• Dual to primal conversion in geometric programming
  Journal of Optimization Theory and Applications, 1978
• A set of geometric programming test problems and their solutions
  Mathematical Programming, 1976
• A modified concave simplex algorithm for geometric programming
  Journal of Optimization Theory and Applications, 1975
• Convex Analysis
  Published by Walter de Gruyter GmbH ,1970