Convergence property of the Iri-Imai algorithm for some smooth convex programming problems

DOI10.1007/BF02191783zbMath0819.90073MaRDI QIDQ1335125

Shu-Zhong Zhang

Publication date: 27 September 1994

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

interior-point algorithmssmooth convex programmingglobally linear convergence rateIri-Imai algorithm

Mathematics Subject Classification ID

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

Related Items

Potential reduction method for harmonically convex programming ⋮ New complexity results for the Iri-Imai method ⋮ Les effets de l'exposant de la fonction barrière multiplicative dans les méthodes de points intérieurs ⋮ Value estimation approach to the Iri-Imai method for constrained convex optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• A potential-reduction variant of Renegar's short-step path-following method for linear programming
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• A multiplicative barrier function method for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
• A proof of the polynomiality of the Iri-Imai method
• On the classical logarithmic barrier function method for a class of smooth convex programming problems
• Polynomial affine algorithms for linear programming
• A variation on Karmarkar’s algorithm for solving linear programming problems
• A Large-Step Analytic Center Method for a Class of Smooth Convex Programming Problems
• Convex Analysis