Primal-dual algorithms for linear programming based on the logarithmic barrier method
From MaRDI portal
Publication:1337204
DOI10.1007/BF02191759zbMath0820.90068OpenAlexW2032415977MaRDI QIDQ1337204
Jean-Philippe Vial, Benjamin Jansen, Tamás Terlaky, Cornelis Roos
Publication date: 4 December 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02191759
Related Items
A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization, Primal-dual target-following algorithms for linear programming, Solving a class of LP problems with a primal-dual logarithmic barrier method, A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization, The Kantorovich theorem and interior point methods, A primal‐dual interior-point method for linear optimization based on a new proximity function, A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization, Introduction to duality in optimization theory, A new class of polynomial primal-dual methods for linear and semidefinite optimization, The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path, A long-step primal-dual path-following method for semidefinite programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- Computational experience with a primal-dual interior point method for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A polynomial-time algorithm for a class of linear complementarity problems
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- A polynomial method of approximate centers for linear programming
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- The Projective SUMT Method for Convex Programming
- Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
- On the Implementation of a Primal-Dual Interior Point Method
- Path-Following Methods for Linear Programming
- A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
