On the relationship of interior-point methods
Summary: We show that the moving directions of the primal-affine scaling method (with logarithmic barrier function), the dual-affine scaling method (with logarithmic barrier function), and the primal-dual interior point method are merely the Newton directions along three different algebraic ``paths that lead to a solution of the Karush-Kuhn-Tucker conditions of a given linear programming problem. We also derive the missing dual information in the primal-affine scaling method and the missing primal information in the dual-affine scaling method. Basically, the missing information has the same form as the solutions generated by the primal- dual method but with different scaling matrices.
- Insights into the interior-point methods
- Interior-point methods
- Interior-point methods for optimization
- scientific article; zbMATH DE number 1064582
- scientific article; zbMATH DE number 1069182
- scientific article; zbMATH DE number 1889340
- scientific article; zbMATH DE number 1047674
- On the Complexity of a Practical Interior-Point Method
- Interior-point methods for convex programming
- Scaling, shifting and weighting in interior-point methods
- On the interplay among entropy, variable metrics and potential functions in interior-point algorithms
- Insights into the interior-point methods
- scientific article; zbMATH DE number 1322753 (Why is no real title available?)
- An affine scaling method using a class of differential barrier functions: primal approach
This page was built for publication: On the relationship of interior-point methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q687866)
