Feasibility issues in a primal-dual interior-point method for linear programming
From MaRDI portal
Publication:803044
DOI10.1007/BF01588785zbMath0726.90050WikidataQ60140263 ScholiaQ60140263MaRDI QIDQ803044
Publication date: 1990
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
65K05: Numerical mathematical programming methods
90C05: Linear programming
90-08: Computational methods for problems pertaining to operations research and mathematical programming
Related Items
Implementation of interior point methods for mixed semidefinite and second order cone optimization problems, LOQO:an interior point code for quadratic programming, Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem, A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems, A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems, A little theorem of the big \({\mathcal M}\) in interior point algorithms, A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization, Computational experience with a primal-dual interior point method for linear programming, Optimizing over three-dimensional subspaces in an interior-point method for linear programming, A brief description of ALPO, On combined phase 1-phase 2 projective methods for linear programming, Quadratically constrained convex quadratic programmes: Faculty feasible regions, Approximate Farkas lemmas and stopping rules for iterative infeasible-point algorithms for linear programming, A primal-dual infeasible-interior-point algorithm for linear programming, Global convergence in infeasible-interior-point algorithms, Polynomiality of infeasible-interior-point algorithms for linear programming, Linear programming with stochastic elements: An on-line approach, Symmetric indefinite systems for interior point methods, An interior point potential reduction method for constrained equations, A unified approach to infeasible-interior-point algorithms via geometrical linear complementarity problems, Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs, An infeasible-interior-point algorithm using projections onto a convex set, Gigaflops in linear programming, A primal-dual potential reduction method for problems involving matrix inequalities, Primal-dual methods for linear programming, Combining phase I and phase II in a potential reduction algorithm for linear programming, New complexity analysis of IIPMs for linear optimization based on a specific self-regular function, The complexity of self-regular proximity based infeasible IPMs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modification of Karmarkar's linear programming algorithm
- A new polynomial-time algorithm for linear programming
- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- An analysis of an available set of linear programming test problems
- Interior path following primal-dual algorithms. I: Linear programming
- A practical anti-cycling procedure for linearly constrained optimization
- An implementation of Karmarkar's algorithm for linear programming
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A variation on Karmarkar’s algorithm for solving linear programming problems
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- Further Development of a Primal-Dual Interior Point Method
- The multifrontal method and paging in sparse Cholesky factorization
