scientific article; zbMATH DE number 1489800

zbMATH Open0964.90053MaRDI QIDQ4496017FDOQ4496017

Authors: Yinyu Ye, Stephen A. Vavasis 

Publication date: 13 August 2000

Title of this publication is not available (Why is that?)

Recommendations

• A primal-dual interior point method whose running time depends only on the constraint matrix
• An accelerated interior point method whose running time depends only on \(A\) (extended abstract)
• On the Implementation of a Primal-Dual Interior Point Method
• Improving a primal–dual simplex-type algorithm using interior point methods
• A DUAL INTERIOR PRIMAL SIMPLEX METHOD FOR LINEAR PROGRAMMING METHOD
• An Implementation of a Primal-Dual Interior Point Method for Linear Programming
• A primal-dual interior-point algorithm for nonlinear least squares constrained problems
• Some convergence results for primal-dual interior point algorithm for linear programming
• scientific article; zbMATH DE number 1041033
• A primal-infeasible interior point algorithm for linearly constrained convex programming

zbMATH Keywords

linear programminginterior point method

Mathematics Subject Classification ID

Linear programming (90C05) Optimality conditions and duality in mathematical programming (90C46)

Cited In (2)

• A modified layered-step interior-point algorithm for linear programming
• Improved complexity results on solving real-number linear feasibility problems

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 Q4496017)