Interior-point methods for linear programming: a review
From MaRDI portal
Recommendations
Cites work
- A linear programming instance with many crossover events
- A modification of Karmarkar's linear programming algorithm
- A new polynomial-time algorithm for linear programming
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- A primal-dual infeasible-interior-point algorithm for linear programming
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- A variation on Karmarkar’s algorithm for solving linear programming problems
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- An implementation of Karmarkar's algorithm for linear programming
- An interior point potential reduction algorithm for the linear complementarity problem
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Boundary Behavior of Interior Point Algorithms in Linear Programming
- Classroom Note: Initialization of the Simplex Algorithm: An Artificial-Free Approach
- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- Convergence in Karmarkar's algorithm: a review
- Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
- Global convergence of the affine scaling methods for degenerate linear programming problems
- Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- Large-scale linearly constrained optimization
- On the convergence of the affine-scaling algorithm
- On the Implementation of a Primal-Dual Interior Point Method
- Polynomial algorithms in linear programming
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- Polynomiality of infeasible-interior-point algorithms for linear programming
Cited in
(32)- Integrability of vector and multivector fields associated with interior point methods for linear programming
- A polynomial method of approximate centers for linear programming
- Scaling, shifting and weighting in interior-point methods
- Pivot versus interior point methods: Pros and cons
- On the choice of parameters for power-series interior point algorithms in linear programming
- Interior-point methods: Worst case and average case analysis of a phase-I algorithm and a termination procedure.
- Optimized choice of parameters in interior-point methods for linear programming
- A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming
- A scaled central path for linear programming
- Recent developments in interior-point methods
- Some recent advances and new directions in interior point methods for linear programming
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- Fundamentals of cone regression
- Interior point methods meet simplex in Loo, fitting problems
- Some recent advances and new directions in linear programming
- scientific article; zbMATH DE number 4031392 (Why is no real title available?)
- scientific article; zbMATH DE number 4097127 (Why is no real title available?)
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- scientific article; zbMATH DE number 1047679 (Why is no real title available?)
- Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
- An annotated bibliography of network interior point methods
- scientific article; zbMATH DE number 1489809 (Why is no real title available?)
- User'S guide To Lipsol linear-programming interior point solvers V0.4
- Four Good Reasons to Use an Interior Point Solver Within a MIP Solver
- scientific article; zbMATH DE number 194636 (Why is no real title available?)
- scientific article; zbMATH DE number 946715 (Why is no real title available?)
- Interior point methods, a decade after Karmarkar—a survey, with application to the smallest eigenvalue problem
- scientific article; zbMATH DE number 778138 (Why is no real title available?)
- scientific article; zbMATH DE number 871033 (Why is no real title available?)
- scientific article; zbMATH DE number 5018770 (Why is no real title available?)
- scientific article; zbMATH DE number 4185410 (Why is no real title available?)
- Efficient implementation and benchmark of interior point methods for the polynomial \(L_{1}\) fitting problem.
This page was built for publication: Interior-point methods for linear programming: a review
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3150491)
