First-and Second-Order Convex Programming Scaling Algorithms Applied to Geometric Programming

This publication has 10 references indexed in Scilit:

• Convergence results and numerical experiments on a linear programming hybrid algorithm
  European Journal of Operational Research, 1987
• Algorithmic insights and a convergence analysis for a Karmarkar-type of algorithm for linear programming problems
  Naval Research Logistics (NRL), 1987
• A modification of karmarkar's linear programming algorithm
  Algorithmica, 1986
• A new polynomial-time algorithm for linear programming
  Combinatorica, 1984
• On equating the difference between optimal and marginal values of general convex programs
  Journal of Optimization Theory and Applications, 1981
• Dual to primal conversion in geometric programming
  Journal of Optimization Theory and Applications, 1978
• Comparison of generalized geometric programming algorithms
  Journal of Optimization Theory and Applications, 1978
• On a classification scheme for geometric programming and complementarity theorems† †
  Applicable Analysis, 1976
• Linearizing Geometric Programs
  SIAM Review, 1970
• THE STRONG MINKOWSKI FARKAS-WEYL THEOREM FOR VECTOR SPACES OVER ORDERED FIELDS
  Proceedings of the National Academy of Sciences, 1958