Generalization of Karmarkar's algorithm to convex homogeneous functions

DOI10.1016/0167-6377(92)90039-6MaRDI QIDQ1197885zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex
• Karmarkar's algorithm with improved steps
• A Collinear Scaling Interpretation of Karmarkar’s Linear Programming Algorithm
• scientific article; zbMATH DE number 892328
• On the convexity of the multiplicative version of Karmarkar's potential function

Cites work

• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 4197755 (Why is no real title available?)
• A new polynomial-time algorithm for linear programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex
• An extension of Karmarkar's projective algorithm for convex quadratic programming
• Computing Optimal Locally Constrained Steps
• Karmarkar's algorithm with improved steps
• Newton’s Method with a Model Trust Region Modification

Cited in

(2)

• Generalized convexity on affine subspaces with an application to potential functions
• A theorem of the alternative for multihomogeneous functions and its relationship to diagonal scaling of matrices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1197885)