Insights into the interior-point methods

DOI10.1007/BF01415890zbMath0763.90065MaRDI QIDQ4009794

Ruey-Lin Sheu, Shu-Cherng Fang

Publication date: 27 September 1992

Published in: [https://portal.mardi4nfdi.de/entity/Q3031760 ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research] (Search for Journal in Brave)

zbMATH Keywords

interior-point algorithmsKarush-Kuhn-Tucker conditionsprimal-dual interior point methodprimal-affine scaling methoddual-affine scaling method

Mathematics Subject Classification ID

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

Related Items

A convergence analysis for a convex version of Dikin's algorithm ⋮ A perturbation method for solving linear semi-infinite programming problems ⋮ Long-step primal path-following algorithm for monotone variational inequality problems ⋮ Deriving an unconstrained convex program for linear programming

Cites Work

• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• Introduction: New approaches to linear programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• A variation on Karmarkar’s algorithm for solving linear programming problems
• Newton-type methods for unconstrained and linearly constrained optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item