Abstract
At present the interior-point methods of choice are primal—dual infeasible-interior-point methods, where the iterates are kept positive, but allowed to be infeasible. In practice, these methods have demonstrated superior computational performance. From a theoretical point of view, however, they have not been as thoroughly studied as their counterparts — feasible-interior-point methods, where the iterates are required to be strictly feasible. Recently, Kojima et al., Zhang, Mizuno and Potra studied the global convergence of algorithms in the primal—dual infeasible-interior-point framework. In this paper, we continue to study this framework, and in particular we study the local convergence properties of algorithms in this framework. We construct parameter selections that lead toQ-superlinear convergence for a merit function andR-superlinear convergence for the iteration sequence, both at rate 1 +τ whereτ can be arbitrarily close to one.
Similar content being viewed by others
References
A.J. Hoffman, “On approximate solutions of systems of linear inequalities,”Journal of Research of the National Bureau of Standards 49 (1952) 263–265.
M. Kojima, N. Megiddo and S. Mizuno, “A primal—dual infeasible-interior-point algorithm for linear programming,”Mathematical Programming 61 (1993) 263–280.
M. Kojima, S. Mizuno and A. Yoshise, “A primal—dual interior point,” in: [N. Megiddo, editor,Progress in Mathematical Programming: Interior Point and Related Methods] (Springer Verlag, New York, 1989) pp. 29–47.
I.J. Lustig, R.E. Marsten and D.F. Shanno, “Computational experience with a primal—dual interior point method for linear programming,”Linear Algebra and Its Applications 152 (1991) 191–222.
I.J. Lustig, R.E. Marsten and D.F. Shanno, “On implementing Mehrotra's predictor—corrector interior point method for linear programming,”SIAM Journal on Optimization 2 (1992) 435–449.
K.A. McShane, C.L. Monma and D.F. Shanno, “An implementation of a primal—dual interior point method for linear programming,”ORSA Journal on Computing 1 (1989) 70–83.
O.L. Mangasarian, “Error bounds for nondegenerate monotone linear complementarity problems,”Mathematical Programming 48 (1990) 437–445.
N. Megiddo, “Pathways to the optimal set in linear programming,” [in:Progress in Mathematical programming, interior-point and related methods, N. Megiddo, ed.] (Springer-Verlag, New York, 1989) pp. 131–158.
S. Mehrotra, “On the implementation of a primal—dual interior point method,”SIAM Journal on Optimization 2 (1992) 575–601.
S. Mizuno, “Polynomiality of the Kojima—Megiddo—Mizuno infeasible interior point algorithm for linear programming,” Technical Report, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY 14853, USA, 1992.
F.A. Potra, “An infeasible interior-point predictor—corrector algorithm for linear programming,” Report No. 26, Dept. of Mathematics, The University of Iowa, 1992.
F.A. Potra, “A quadratically convergent infeasible interior-point algorithm for linear programming,” Report No. 28, Dept. of Mathematics, The University of Iowa, 1992.
R.A. Tapia, Y. Zhang and Y. Ye, “On the convergence of the iteration sequence in primal—dual interiorpoint methods,” Technical Report No. TR91-24, Dept. of Mathematical Sciences, Rice University, 1991.
S. Wright, “An infeasible-interior-point algorithm for linear complementarity problems,” Preprint MCS-P331-1092, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, Illinois, October, 1992.
Y. Zhang, “On the convergence of a class of infeasible interior-plant algorithms for the horizontal linear complementarity problem,”SIAM Journal on Optimization 4 (1994) 208–227.
Y. Zhang and R.A. Tapia, “A superlinearly convergent polynomial primal—dual interior point algorithm for linear programming,”SIAM Journal on Optimization 3 (1993) 118–133.
Y. Zhang and R.A. Tapia, “Superlinear and quadratic convergence of primal—dual interior point algorithms for linear programming revisited,”JOTA 73 (2) (1992) 229–242.
Y. Zhang, R.A. Tapia and J.E. Dennis, Jr., “On the superlinear and quadratic convergence of primal—dual interior point linear programming algorithms,”SIAM Journal on Optimization 2 (1992) 304–324.
Y. Zhang, R.A. Tapia and F. Potra, “On the superlinear convergence of interior point algorithms for a general class of problems,”SIAM Journal on Optimization 3 (1993) 413–422.
Author information
Authors and Affiliations
Additional information
Research supported in part by NSF DMS-9102761 and DOE DE-FG05-91ER25100.
Corresponding author.
Rights and permissions
About this article
Cite this article
Zhang, Y., Zhang, D. Superlinear convergence of infeasible-interior-point methods for linear programming. Mathematical Programming 66, 361–377 (1994). https://doi.org/10.1007/BF01581155
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01581155