A little theorem of the big Mu in interior point algorithms

@article{Kojima1993ALT,
  title={A little theorem of the big Mu in interior point algorithms},
  author={Masakazu Kojima and Shinji Mizuno and Akiko Yoshise},
  journal={Math. Program.},
  year={1993},
  volume={59},
  pages={361-375}
}
When we apply interior point algorithms to various problems including linear programs, convex quadratic programs, convex programs and complementarity problems, we often embed an original problem to be solved in an artificial problem having a known interior feasible solution from which we start the algorithm. The artificial problem involves a constant Jd (or constants) which we need to choose large enough to ensure the equivalence between the artificial problem and the original problem… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS

Citations

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

Persistent robot formation flight via online substitution

2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) • 2016
View 1 Excerpt

Multi-Robot Persistent Coverage with stochastic task costs

2015 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) • 2015
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 25 references

An O(n3L) long step path following algorithm for a linear complementarity problem

S. Mizuno, M. J. Todd
Technical Report No. 23, Department of Industrial Engineering and Management, Tokyo Institute of Technology, Oh-Okayama, Meguro-ku (Tokyo, Japan, 1989). • 1989
View 5 Excerpts
Highly Influenced

Pathways to the optimal set in linear programming

N. Megiddo
in: N. Megiddo, ed., Progress in Mathematical Programming, Interior-Point and Related Methods (Springer, New York, 1988) pp. 131-158. • 1988
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…