Primal-dual algorithms for linear programming based on the logarithmic barrier method
From MaRDI portal
Recommendations
- Primal-dual methods for linear programming
- A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
- Interior path following primal-dual algorithms. I: Linear programming
- scientific article; zbMATH DE number 4164543
- A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
Cites work
- A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming
- A new polynomial-time algorithm for linear programming
- A polynomial method of approximate centers for linear 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
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- Computational experience with a primal-dual interior point method for linear programming
- scientific article; zbMATH DE number 4131946 (Why is no real title available?)
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- scientific article; zbMATH DE number 590363 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 3793772 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
- 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
- Path-Following Methods for Linear Programming
- The Projective SUMT Method for Convex Programming
Cited in
(27)- Interior path following primal-dual algorithms. I: Linear programming
- Solving a class of LP problems with a primal-dual logarithmic barrier method
- A long-step primal-dual path-following method for semidefinite programming
- Rank-one techniques in log-barrier function methods for linear programming
- A primal-dual interior point method whose running time depends only on the constraint matrix
- A full Nesterov-Todd-step feasible primal-dual interior point algorithm for convex quadratic semi-definite optimization
- The Kantorovich theorem and interior point methods
- 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 primal-dual interior-point method for linear programming based on a weighted barrier function
- Primal-dual target-following algorithms for linear programming
- Primal-dual methods for linear programming
- A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization
- Introduction to duality in optimization theory
- scientific article; zbMATH DE number 432999 (Why is no real title available?)
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- scientific article; zbMATH DE number 4167847 (Why is no real title available?)
- scientific article; zbMATH DE number 653032 (Why is no real title available?)
- A primal‐dual interior-point method for linear optimization based on a new proximity function
- scientific article; zbMATH DE number 776084 (Why is no real title available?)
- scientific article; zbMATH DE number 776089 (Why is no real title available?)
- Barrier Functions and Interior-Point Algorithms for Linear Programming with Zero-, One-, or Two-Sided Bounds on the Variables
- scientific article; zbMATH DE number 934836 (Why is no real title available?)
- A Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
- Properties of the central points in linear programming problems
- Convergence and iteration-complexity of a primal-dual majorization-minimization method for large-scale linear programming
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
This page was built for publication: Primal-dual algorithms for linear programming based on the logarithmic barrier method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1337204)
