A primal-dual interior-point method based on a new kernel function with linear growth rate

@inproceedings{Bai2002API,
  title={A primal-dual interior-point method based on a new kernel function with linear growth rate},
  author={Y. Q. Bai and C. Roos},
  year={2002}
}
We introduce a new barrier function which has a linear growth term in its kernel function. So far all existing kernel functions have a quadratic (or higher degree) growth term. Despite this, a large-update primal-dual interior-point method based on this kernel function has the same iteration bound as the classical primal-dual method, which is based on the logarithmic barrier method. 

Citations

Publications citing this paper.
Showing 1-10 of 15 extracted citations

References

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

A comparative study of barrier functions for primal-dual interior-point algorithms in linear optimization

  • C. Roos
  • 2002
4 Excerpts

Self-Regularity: A New Paradigm for Primal-Dual Interior-Point Algorithms

  • J. Peng, C. Roos, T. Terlaky
  • 2002
2 Excerpts

A primal-dual interior-point algorithm based on an exponential barrier

  • Y. Q. Bai, C. Roos, M. El ghami
  • To appear in Optimization Methods & Software
  • 2001
4 Excerpts

Pathways to the optimal set in linear programming

  • N. Megiddo
  • Identical version in : Proceedings of the 6th…
  • 1989
1 Excerpt

An “analytic center” for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming

  • G. Sonnevend
  • System Modelling and Optimization : Proceedings…
  • 1985
1 Excerpt

Similar Papers

Loading similar papers…