scientific article; zbMATH DE number 1322430

MaRDI QIDQ4253467zbMATH OpenFDO

Authors Shinji Mizuno, Florian Jarre

Publication date 9 August 1999

zbMATH Keywords

inexact computationinfeasible-interior-point algorithmpolynomial-time convergenceprimal-dual linear programming

Mathematics Subject Classification ID

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

Recommendations

• Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation.
• Polynomiality of infeasible-interior-point algorithms for linear programming
• Convergence analysis of inexact infeasible-interior-point algorithms for solving linear programming problems
• Large-Scale Scientific Computing
• Convergence of a class of inexact interior-point algorithms for linear programs

Cited in

(12)

• Convergence analysis of the inexact infeasible interior-point method for linear optimization
• Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming
• Polynomiality of infeasible-interior-point algorithms for linear programming
• Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
• Polynomiality of an inexact infeasible interior point algorithm for semidefinite programming
• The convergence of an interior-point method using modified search directions in final iterations
• Convergence analysis of inexact infeasible-interior-point algorithms for solving linear programming problems
• Convergence of a class of inexact interior-point algorithms for linear programs
• A primal-dual algorithm for solving polyhedral conic systems with a finite-precision machine
• scientific article; zbMATH DE number 2153290 (Why is no real title available?)
• scientific article; zbMATH DE number 2195332 (Why is no real title available?)
• Large-Scale Scientific Computing

This page was built for publication:

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