A New Infinity-Norm Path Following Algorithm for Linear Programming
From MaRDI portal
Recommendations
- Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method
- Interior path following primal-dual algorithms. I: Linear programming
- Path-Following Methods for Linear Programming
- General central path and the largest step general central path following algorithm for linear programming
- A Centered Projective Algorithm for Linear Programming
Cited in
(11)- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
- An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners
- Hessian distances and their applications in the complexity analysis of interior-point methods
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
- Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization
- Enlarging neighborhoods of interior-point algorithms for linear programming via least values of proximity measure functions
This page was built for publication: A New Infinity-Norm Path Following Algorithm for Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4838954)
