On the convexity of the multiplicative version of Karmarkar's potential function

DOI10.1007/BF01580721zbMath0657.90060MaRDI QIDQ1111466

Hiroshi Imai

Publication date: 1988

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

strict convexity; Karmarkar's potential function; multiplicative version of the potential function

Mathematics Subject Classification ID

90C05: Linear programming

Related Items

Geodesic convexity on Rⁿ¹₊, Les effets de l'exposant de la fonction barrière multiplicative dans les méthodes de points intérieurs, On the computation of weighted analytic centers and dual ellipsoids with the projective algorithm, On a functional operation generating convex functions. II: Algebraic properties, New trajectory-following polynomial-time algorithm for linear programming problems, A survey of search directions in interior point methods for linear programming, Generalized convexity on affine subspaces with an application to potential functions, Degeneracy in interior point methods for linear programming: A survey, Potential-reduction methods in mathematical programming, A class of polynomial variable metric algorithms for linear optimization, Search directions for interior linear-programming methods

Cites Work

• A new polynomial-time algorithm for linear programming
• An extension of Karmarkar's algorithm for linear programming using dual variables
• A multiplicative barrier function method for linear programming
• A note on degeneracy in linear programming