On combined phase 1-phase 2 projective methods for linear programming
From MaRDI portal
The authors compare several projective algorithms for solving linear programming problems. These algorithms have the feature that they approach feasibility and optimality simultaneously. The directions used in these methods are compared.
Recommendations
Cites work
- A combined phase I-phase II projective algorithm for linear programming
- A Family of Search Directions for Karmarkar's Algorithm
- A monotonic projective algorithm for fractional linear programming
- A new polynomial-time algorithm for linear programming
- A polynomial Newton method for linear programming
- A polynomial-time algorithm for a class of linear complementarity problems
- A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start
- A variant of Karmarkar's linear programming algorithm for problems in standard form
- An extension of Karmarkar's algorithm for linear programming using dual variables
- An extension of Karmarkar's algorithm for solving a system of linear homogeneous equations on the simplex
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- An implementation of Karmarkar's algorithm for linear programming
- Computational experience with a primal-dual interior point method for linear programming
- Conical projection algorithms for linear programming
- Feasibility issues in a primal-dual interior-point method for linear programming
- scientific article; zbMATH DE number 4199962 (Why is no real title available?)
- scientific article; zbMATH DE number 4151220 (Why is no real title available?)
- Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm
- Linear updates for a single-phase projective method
- On Anstreicher's combined phase I-phase II projective algorithm for linear programming
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
- Search directions for interior linear-programming methods
Cited in
(12)- A combined phase I-phase II projective algorithm for linear programming
- On Anstreicher's combined phase I-phase II projective algorithm for linear programming
- A projective algorithm for linear programming with no regularity condition
- Algorithms of projective optimization which use the multipliers of previous iterations
- An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
- Combining phase I and phase II in a potential reduction algorithm for linear programming
- A primal-dual interior-point method based on various selections of displacement step for symmetric optimization
- Alternative Approaches to Feasibility in Projective Methods for Linear Programming
- scientific article; zbMATH DE number 1225250 (Why is no real title available?)
- scientific article; zbMATH DE number 2110459 (Why is no real title available?)
- On the step choice in projection algorithms for large-scale linear programming problems
- Combined projected gradient algorithm for linear programming
This page was built for publication: On combined phase 1-phase 2 projective methods for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1207329)
