scientific article; zbMATH DE number 1782596

MaRDI QIDQ4545873zbMATH OpenFDO

Authors Junling Wang, Yansong du

Publication date 30 October 2002

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A primal-dual infeasible-interior-point algorithm for linear programming
• Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems
• A primal-dual infeasible-interior-point algorithm for linear semi- infinite programming
• Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
• A primal-infeasible interior point algorithm for linearly constrained convex programming
• A primal-dual infeasible interior point algorithm for semidefinite programming
• A primal-dual affine-scaling potential-reduction algorithm for linear programming
• A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems
• A primal-dual infeasible-interior-point algorithm for multiple objective linear programming problems
• An infeasible interior-point algorithm for solving primal and dual geometric programs

Cited in

(4)

• An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
• A primal-dual affine-scaling potential-reduction algorithm for linear programming
• An \(O(\sqrt {n} L)\) iteration bound primal-dual cone affine scaling algorithm for linear programming
• Primal-dual affine-scaling algorithms fail for semidefinite 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 Q4545873)