On finding a vertex solution using interior point methods
From MaRDI portal
Publication:1174841
Recommendations
- scientific article; zbMATH DE number 434731
- Interior proximal point algorithm for linear programs
- Finding an interior point in the optimal face of linear programs
- Determination of optimal vertices from feasible solutions in unimodular linear programming
- An interior point method for linear programming
Cites work
- scientific article; zbMATH DE number 3717147 (Why is no real title available?)
- scientific article; zbMATH DE number 193993 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- A Self-Correcting Version of Karmarkar’s Algorithm
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- An implementation of Karmarkar's algorithm for linear programming
- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- Computational experience with a primal-dual interior point method for linear programming
- Further Development of a Primal-Dual Interior Point Method
- Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
- Implementations of Affine Scaling Methods: Approximate Solutions of Systems of Linear Equations Using Preconditioned Conjugate Gradient Methods
- 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
- Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited
Cited in
(21)- On the finite convergence of interior-point algorithms for linear programming
- A Mehrotra type predictor-corrector interior-point algorithm for linear programming
- An \(\operatorname{O}(\sqrt{r}(\operatorname{cond}(G))^{1 / 4}\log \varepsilon^{- 1})\) iteration predictor-corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization
- Search for feasible solutions by interior point algorithms
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
- Solving symmetric indefinite systems in an interior-point method for linear programming
- Cubically convergent method for locating a nearby vertex in linear programming
- Recovering an optimal LP basis from an interior point solution
- Finding the closest extreme vertex to a fixed point
- Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems
- Mehrotra-type predictor-corrector algorithm revisited
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
- Selected bibliography on degeneracy
- A finite termination Mehrotra-type predictor-corrector algorithm
- Multiple centrality corrections in a primal-dual method for linear programming
- Symmetric indefinite systems for interior point methods
- Vertex-searching method for linear interaction programming
- Asymptotic convergence in a generalized predictor-corrector method
- On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
- Degeneracy in interior point methods for linear programming: A survey
This page was built for publication: On finding a vertex solution using interior point methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1174841)
