Insights into the interior-point methods

DOI10.1007/BF01415890MaRDI QIDQ4009794zbMATH OpenFDO

Authors Ruey-Lin Sheu, Shu-Cherng Fang

Publication date 27 September 1992

Published in ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01415890

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Recommendations

• On the relationship of interior-point methods
• A Low Complexity Interior-Point Algorithm for Linear Programming
• A survey of search directions in interior point methods for linear programming
• Search directions for interior linear-programming methods
• Interior path following primal-dual algorithms. I: Linear programming

Cites work

• A modification of Karmarkar's linear programming algorithm
• A new polynomial-time algorithm for linear programming
• A variation on Karmarkar’s algorithm for solving linear programming problems
• scientific article; zbMATH DE number 4164543 (Why is no real title available?)
• scientific article; zbMATH DE number 4112377 (Why is no real title available?)
• scientific article; zbMATH DE number 4112388 (Why is no real title available?)
• scientific article; zbMATH DE number 194636 (Why is no real title available?)
• scientific article; zbMATH DE number 3238675 (Why is no real title available?)
• Introduction: New approaches to linear programming
• Newton-type methods for unconstrained and linearly constrained optimization
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method

Cited in

(19)

• A survey of search directions in interior point methods for linear programming
• Long-step primal path-following algorithm for monotone variational inequality problems
• Deriving an unconstrained convex program for linear programming
• Scaling, shifting and weighting in interior-point methods
• The convergence of an interior-point method using modified search directions in final iterations
• A convergence analysis for a convex version of Dikin's algorithm
• A perturbation method for solving linear semi-infinite programming problems
• Search directions for interior linear-programming methods
• A scaled central path for linear programming
• IP from an SQP point of view
• Local Convergence Properties of New Methods in Linear Programming
• scientific article; zbMATH DE number 1322753 (Why is no real title available?)
• A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
• scientific article; zbMATH DE number 1047674 (Why is no real title available?)
• An alternative derivation of the projective interior point method for linear programming through the least squares approach
• scientific article; zbMATH DE number 4197738 (Why is no real title available?)
• On the relationship of interior-point methods
• A unified view of interior point methods for linear programming
• Optimizing over three-dimensional subspaces in an interior-point method for linear programming

This page was built for publication: Insights into the interior-point methods

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