The modified barrier function method for linear programming and its extensions
From MaRDI portal
The author studies the application of the modified barrier function (MBF) method and its extensions to the linear programming (LP) problems and compares the results with the application of the LP barrier method. The MBF LP method is extended by using Newton's iteration, and it is shown that the MBF method avoids the numerical stability problems even when the LP barrier methods have them.
Recommendations
- One modification of the logarithmic barrier function method in linear and convex programming
- scientific article; zbMATH DE number 776089
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A multiplicative barrier function method for linear programming
- Dual barrier functions with superfast rates of convergence for the linear programming problem
Cites work
- Generation of degenerate linear programming problems
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems
- The Created Response Surface Technique for Optimizing Nonlinear, Restrained Systems
- Unified complexity analysis for Newton LP methods
Cited in
(3)
This page was built for publication: The modified barrier function method for linear programming and its extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q918138)
