scientific article; zbMATH DE number 4197744
From MaRDI portal
Publication:5202843
Recommendations
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming
- scientific article; zbMATH DE number 1047677
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- Potential-reduction methods in mathematical programming
Cited in
(26)- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- A note on a potential reduction algorithm for LP with simultaneous primal-dual updating
- Long steps in an \(O(n^ 3L)\) algorithm for linear programming
- On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise
- An interior point method, based on rank-1 updates, for linear programming
- An O(n^ 3 L) primal-dual potential reduction algorithm for solving convex quadratic programs
- Extensions of the potential reduction algorithm for linear programming
- Potential-reduction methods in mathematical programming
- On the worst case complexity of potential reduction algorithms for linear programming
- Near boundary behavior of primal-dual potential reduction algorithms for linear programming
- Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis
- An infeasible-interior-point potential-reduction algorithm for linear programming
- A primal-dual variant of the Iri-Imai algorithm for linear programming
- A Centered Projective Algorithm for Linear Programming
- Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method
- A Short-Cut Potential Reduction Algorithm for Linear Programming
- scientific article; zbMATH DE number 1047677 (Why is no real title available?)
- Achievable potential reductions in the method of Kojima et al. in the case of linear programming
- On the length of primal-dual projection of potential reduction algorithm
- A new potential reduction algorithm for smooth convex programming
- Computational experience with a modified potential reduction algorithm for linear programming
- A projected‐steepest‐descent potential‐reduction algorithm for convex programming problems
- An active-set strategy in an interior point method for linear programming
- O(n\({}^ pL)\)-iteration and \(O(n^ 3L)\)-operation potential reduction algorithms for linear programming
- A potential-reduction variant of Renegar's short-step path-following method for linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202843)
