scientific article; zbMATH DE number 7413597
From MaRDI portal
Publication:5158552
zbMath1479.90218MaRDI QIDQ5158552
M. El Ghami, Venansius Baryamureeba, Trond Steihaug
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
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
global convergencelinear optimizationprimal-dualinexact search directioninfeasible interior point algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Local path-following property of inexact interior methods in nonlinear programming
- Feasibility issues in a primal-dual interior-point method for linear 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
- A primal-dual infeasible-interior-point algorithm for linear programming
- Inexact interior-point method
- Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation.
- Inexact primal-dual interior point iteration for linear programs in function spaces
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
- 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
- Convergence Analysis of an Inexact Feasible Interior Point Method for Convex Quadratic Programming
- A Preconditioner for Linear Systems Arising From Interior Point Optimization Methods
- Inexact Newton Methods
- On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
- Large-Scale Scientific Computing
This page was built for publication:
