Generalization of Karmarkar's algorithm to convex homogeneous functions

DOI10.1016/0167-6377(92)90039-6zbMath0760.90077OpenAlexW1980375658MaRDI QIDQ1197885

Bahman Kalantari

Publication date: 16 January 1993

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(92)90039-6

zbMATH Keywords

homogeneous convex function

Mathematics Subject Classification ID

Convex programming (90C25) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices

Cites Work

• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Karmarkar's algorithm with improved steps
• An extension of Karmarkar's algorithm for linear programming using dual variables
• An extension of Karmarkar's projective algorithm for convex quadratic programming
• An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex
• Computing Optimal Locally Constrained Steps
• Newton’s Method with a Model Trust Region Modification

This page was built for publication: Generalization of Karmarkar's algorithm to convex homogeneous functions