A polynomial-time algorithm for linear optimization based on a new simple kernel function

@article{Bai2003APA,
  title={A polynomial-time algorithm for linear optimization based on a new simple kernel function},
  author={Yan-Qin Bai and Kees Roos},
  journal={Optimization Methods and Software},
  year={2003},
  volume={18},
  pages={631-646}
}
We present a new barrier function, based on a kernel function with a linear growth term and an inverse linear barrier term. Existing kernel functions have a quadratic (or higher degree) growth term, and a barrier term that is either transcendent (e.g. logarithmic) or of a more complicated algebraic form. So the new kernel function has the simplest possible form compared with all existing kernel functions. It is shown that a primal–dual interior-point algorithm for linear optimization (LO) based… CONTINUE READING

From This Paper

Topics from this paper.
12 Citations
6 References
Similar Papers

Citations

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

References

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

Self-regularity. A New Paradigm for Primal–Dual Interior-Point Algorithms, Princeton University Press, Princeton

  • J. Peng, C. Roos, T. Terlaky
  • 2002
Highly Influential
4 Excerpts

Pathways to the optimal set in linear programming

  • N. Megiddo
  • Identical version. In: Proceeding of the 6th…
  • 1986
1 Excerpt

analytic center’for polyhedrons and new classes of global algorithms for linrae (smooth

  • G. Sonnevend
  • convex) programming. In: A. Prekopa, J. Szelezsab…
  • 1986
1 Excerpt

Similar Papers

Loading similar papers…