A review of termination rules of an inexact primal-dual interior point method for linear programming problems

zbMATH Open1479.90218MaRDI QIDQ5158552FDOQ5158552

Authors: Venansius Baryamureeba, Trond Steihaug, M. El Ghami 

Publication date: 25 October 2021

Full work available at URL: http://archives-web.univ-paris1.fr/rev-inv-ope/fileadmin/rev-inv-ope/files/39318/39318-11.pdf

Recommendations

• Large-Scale Scientific Computing
• scientific article; zbMATH DE number 5233132
• Convergence analysis of inexact infeasible-interior-point algorithms for solving linear programming problems
• Inexact interior-point method
• Convergence of a class of inexact interior-point algorithms for linear programs

zbMATH Keywords

global convergenceprimal-duallinear optimizationinexact search directioninfeasible interior point algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Cites Work

• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• Feasibility issues in a primal-dual interior-point method for linear programming
• Inexact Newton Methods
• A Preconditioner for Linear Systems Arising From Interior Point Optimization Methods
• A primal-dual infeasible-interior-point algorithm for linear programming
• Inexact interior-point method
• Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
• Convergence analysis of an inexact feasible interior point method for convex quadratic programming
• Computational experience with a primal-dual interior point method for linear programming
• Convergence analysis of the inexact infeasible interior-point method for linear optimization
• Convergence analysis of inexact infeasible-interior-point algorithms for solving linear programming problems
• Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation.
• Title not available (Why is that?)
• Convergence of a class of inexact interior-point algorithms for linear programs
• Local path-following property of inexact interior methods in nonlinear programming
• Inexact primal-dual interior point iteration for linear programs in function spaces
• Large-Scale Scientific Computing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Large-Scale Scientific Computing

Uses Software

• PDNET

This page was built for publication: A review of termination rules of an inexact primal-dual interior point method for linear programming problems

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