Ill-conditionedness and Interior-point Methods

@inproceedings{Asic2001IllconditionednessAI,
  title={Ill-conditionedness and Interior-point Methods},
  author={Miroslav D. Asic and Vera Kovacevic-Vujcic},
  year={2001}
}
As it is well-known, since the discovery of the interior-point methods linear programming (LP) is no longer synonymous with the celebrated simplex method. The interior-point methods (IPMs) have not only a better complexity bound than the simplex method (polynomial vs. exponential) but also enjoy practical efficiency and can be considerably faster than the simplex method for many (but not for all) large scale problems. It is the purpose of this paper to demonstrate that in the case of degeneracy… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-5 of 5 references

Ašić: Stabilization of interior-point methods for linear programming

M.D.V.V. Kovačević-Vujčić
Computational Optimization and Applications, • 1999
View 6 Excerpts
Highly Influenced

Primal-dual interior-point methods

View 7 Excerpts
Highly Influenced

Hopdm (version 2.12) | a Fast Lp Solver Based on a Primal-dual Interior Point Method

Jacek GondzioSystems
1995
View 7 Excerpts
Highly Influenced

On the Implementation of a Primal-Dual Interior Point Method

SIAM Journal on Optimization • 1992
View 1 Excerpt

Similar Papers

Loading similar papers…