A global Newton method. II: Analytic centers

DOI10.1007/BF01585168zbMath0802.58008MaRDI QIDQ1321647

Allen A. Goldstein

Publication date: 28 April 1994

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

zbMATH Keywords

analytic centersglobal Newton methodcentering

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Implicit function theorems; global Newton methods on manifolds (58C15)

Related Items (4)

New inequalities of the Kantorovich type for bounded linear operators in Hilbert spaces ⋮ On complexity of the translational-cut algorithm for convex minimax problems ⋮ Convexity conditions of Kantorovich function and related semi-infinite linear matrix inequalities ⋮ Entropic perturbation method for solving a system of linear inequalities

Cites Work

• An analog of Karmarkar's algorithm for inequality constrained liner programs, with a `new' class of projective transformations for centering a polytope
• A polynomial-time algorithm, based on Newton's method, for linear programming
• Karmarkar's linear programming algorithm and Newton's method
• Newton's Method for B-Differentiable Equations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A global Newton method. II: Analytic centers