scientific article; zbMATH DE number 4197744

MaRDI QIDQ5202843zbMATHFDO

Authors Yinyu Ye

Publication date 1990

zbMATH Keywords

primal-dual potential functioninterior algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60)

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

(18)

• An active-set strategy in an interior point method for linear programming
• On the length of primal-dual projection of potential reduction algorithm
• Computational experience with a modified potential reduction algorithm for linear programming
• Extensions of the potential reduction algorithm for linear programming
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• A note on a potential reduction algorithm for LP with simultaneous primal-dual updating
• Predictor-corrector primal-dual interior point method for solving economic dispatch problems: a postoptimization analysis
• A projected‐steepest‐descent potential‐reduction algorithm for convex programming problems
• A primal-dual variant of the Iri-Imai algorithm for linear programming
• A Short-Cut Potential Reduction Algorithm for Linear Programming
• A Centered Projective Algorithm for Linear Programming
• Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
• On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise
• Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method
• An infeasible-interior-point potential-reduction algorithm for linear programming
• Near boundary behavior of primal-dual potential reduction algorithms for linear programming
• A new potential reduction algorithm for smooth convex programming
• Long steps in an \(O(n^ 3L)\) 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)