On finding a vertex solution using interior point methods
From MaRDI portal
Publication:1174841
DOI10.1016/0024-3795(91)90277-4zbMath0737.65050OpenAlexW2078519610MaRDI QIDQ1174841
Publication date: 25 June 1992
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(91)90277-4
linear programmingsimplex methodprimal-dual interior-point methodcontrolled random perturbationperturbed linear programvertex solution
Related Items
An O(r(cond(G))1/4log¼ϵ−1) iteration predictor–corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization, Recovering an optimal LP basis from an interior point solution, Asymptotic convergence in a generalized predictor-corrector method, A finite termination Mehrotra-type predictor-corrector algorithm, Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms, An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming, Mehrotra-type predictor-corrector algorithm revisited, On the finite convergence of interior-point algorithms for linear programming, A Mehrotra type predictor-corrector interior-point algorithm for linear programming, Symmetric indefinite systems for interior point methods, Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming, Multiple centrality corrections in a primal-dual method for linear programming, On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems, Selected bibliography on degeneracy, Degeneracy in interior point methods for linear programming: A survey, Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems, Solving symmetric indefinite systems in an interior-point method for linear programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational experience with a primal-dual interior point method for linear programming
- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited
- 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
- On the Implementation of a Primal-Dual Interior Point Method
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
- Further Development of a Primal-Dual Interior Point Method
- Implementations of Affine Scaling Methods: Approximate Solutions of Systems of Linear Equations Using Preconditioned Conjugate Gradient Methods
- A Self-Correcting Version of Karmarkar’s Algorithm
