Solving a class of LP problems with a primal-dual logarithmic barrier method
From MaRDI portal
Publication:1129972
Recommendations
Cites work
- scientific article; zbMATH DE number 4126998 (Why is no real title available?)
- scientific article; zbMATH DE number 597812 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
- A new polynomial-time algorithm for linear programming
- HOPDM - a higher order primal-dual method for large scale linear programming
- Implementing cholesky factorization for interior point methods of linear programming
- Implementing interior point linear programming methods in the Optimization Subroutine Library
- Implementing the Simplex Method: The Initial Basis
- Implementing the simplex method for the Optimization Subroutine Library
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- Primal-dual algorithms for linear programming based on the logarithmic barrier method
Cited in
(7)- scientific article; zbMATH DE number 778138 (Why is no real title available?)
- An interior-point approach for primal block-angular problems
- A build-up variant of the logarithmic barrier method for LP
- A preconditioning technique for Schur complement systems arising in stochastic optimization
- A Logarithmic Barrier Approach To Solving The Dashboard Planning Problem
- scientific article; zbMATH DE number 6027003 (Why is no real title available?)
- Sparse approximations with interior point methods
This page was built for publication: Solving a class of LP problems with a primal-dual logarithmic barrier method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129972)
