×

A polynomial method of approximate centers for linear programming. (English) Zbl 0771.90067

The introduction and the last section illustrate clearly how this paper relates to the literature. The authors give a general picture of the stream of research that evolved from the publication of the Karmarkar method in 1984 and resulted in the development of a number of so-called interior point methods. Such methods are discovered to be strictly interrelated. For example, in a previous paper of the second author, it is stated that “the projective algorithms for a phase II problems are all the same”.
The method proposed here is essentially that of C. C. Gonzaga [SIAM Rev. 34, No. 2, 167-224 (1992; Zbl 0763.90063)] and hence belongs to the category of path following methods. So, where is the contribution? It is in the convergence analysis. Providing a simple and elegant proof of the polynomial complexity of the method is the main topic of the paper.
The method has its limitations — the feasible regions of both the problem and its dual must have non-empty interiors and the coefficient matrix full row rank (although this latter hypothesis is claimed to be not essential).
It is interesting to note that, in contrast with the promise of developing, in a subsequent note, some trickery that will lead to a record complexity, the method is deluding, when it comes to practical efficiency. The remedies are in the spirit of other already proposed methods.
For the high quality of this paper, it leaves the desire of refreshing novelty in either the approach or the class of problems dealt with. This stream of research seems to be close to saturate its potential. Fortunately a revival of interest toward nonlinear optimization is emerging within the field of interior point methods.

MSC:

90C05 Linear programming
90-08 Computational methods for problems pertaining to operations research and mathematical programming
90C60 Abstract computational complexity for mathematical programming problems

Citations:

Zbl 0763.90063
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] K.M. Anstreicher, ”A monotonic projective algorithm for fractional linear programming,”Algorithmica 1 (1986) 483–498. · Zbl 0625.90088 · doi:10.1007/BF01840458
[2] K.M. Anstreicher and R.A. Bosch, ”Long steps in an O(n 3 L) algorithm for linear programming,”Mathematical Programming 54 (1992) 251–265, this issue. · Zbl 0783.90066 · doi:10.1007/BF01586053
[3] E.R. Barnes, ”A variation on Karmarkar’s algorithm for solving linear programming problems,”Mathematical Programming 36 (1986) 174–182. · Zbl 0626.90052 · doi:10.1007/BF02592024
[4] G. De Ghellinck and J.-Ph. Vial, ”A polynomial Newton method for linear programming,”Algorithmica 1 (1986) 425–453. · Zbl 0629.90058 · doi:10.1007/BF01840456
[5] I. Dikin, ”Iterative solution of problems of linear and quadratic programming,”Doklady Akademiia Nauk SSSR 174 (1967) 747–748. · Zbl 0189.19504
[6] R.M. Freund, ”Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function,”Mathematical Programming 51 (1991) 203–222. · Zbl 0743.90073 · doi:10.1007/BF01586933
[7] K.R. Frisch, ”The logarithmic potential method of convex programming,” Memorandum, Institute of Economics, University of Oslo (Oslo, Norway, 1955).
[8] P.E. Gill, W. Murray, M.A. Saunders, J.A. Tomlin and M.H. Wright, ”On projected Newton barrier methods for linear programming and an equivalence to Karmarkar’s method,”Mathematical Programming 36 (1986) 183–209. · Zbl 0624.90062 · doi:10.1007/BF02592025
[9] D. Goldfarb and S. Liu, ”An O(n 3 L) primal interior point algorithm for convex quadratic programming,”Mathematical Programming 49 (1991) 325–340. · Zbl 0717.90055 · doi:10.1007/BF01588795
[10] C.C. Gonzaga, ”An algorithm for solving linear programming problems in O(n 3 L) operations,” in: N. Megiddo, ed.,Progress in Mathematical Programming (Springer, New York, 1987) pp. 1–28.
[11] C.C. Gonzaga, ”Polynomial affine algorithms for linear programming,”Mathematical Programming 49 (1990) 7–21. · Zbl 0777.90027 · doi:10.1007/BF01588776
[12] P. Huard, ”Resolution of mathematical programming with nonlinear constraints by the method of centers,” in: J. Abadie, ed.,Non-Linear Programming (North-Holland, Amsterdam, 1967) pp. 207–219. · Zbl 0157.49701
[13] N. Karmarkar, ”A new polynomial-time algorithm for linear programming,”Combinatorica 4 (1984) 373–395. · Zbl 0557.90065 · doi:10.1007/BF02579150
[14] M. Kojima, S. Mizuno and A. Yoshise, ”A polynomial-time algorithm for a class of linear complementarity problems,”Mathematical Programming 44 (1989) 1–26. · Zbl 0676.90087 · doi:10.1007/BF01587074
[15] N. Megiddo, ”Pathways to the optimal set in linear programming,” in:Proceedings of the 6th Mathematical Programming Symposium of Japan (Nagoya, Japan, 1986) pp. 1–36.
[16] R.C. Monteiro and I. Adler, ”An O(n 3 L) primal–dual interior point algorithm for linear programming,”Mathematical Programming 44 (1987) 27–42. · Zbl 0676.90038 · doi:10.1007/BF01587075
[17] V. Pan, ”How can we speed up matrix multiplication?”SIAM Review 26 (1984) 393–415. · Zbl 0563.65028 · doi:10.1137/1026076
[18] J. Renegar, ”A polynomial-time algorithm based on Newton’s method for linear programming,”Mathematical Programming 40 (1988) 59–95. · Zbl 0654.90050 · doi:10.1007/BF01580724
[19] C. Roos, ”A new trajectory following polynomial-time algorithm for the linear programming problem,”Journal on Optimization Theory and its Applications 63 (1989) 433–458. · Zbl 0662.90047 · doi:10.1007/BF00939806
[20] Gy. Sonnevend, ”An analytic centre for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming,” Preprint, Department of Numerical Analysis, Institute of Mathematics, Eötvös University (Budapest, Hungary, 1985).
[21] M.J. Todd and B.P. Burrell, ”An extension of Karmarkar’s algorithm for linear programming using dual variables,”Algorithmica 1 (1986) 409–424. · Zbl 0621.90048 · doi:10.1007/BF01840455
[22] M.J. Todd and Y. Ye, ”A centered projective algorithm for linear programming,”Mathematics of Operations Research 15 (1990) 508–529. · Zbl 0722.90044 · doi:10.1287/moor.15.3.508
[23] P.M. Vaidya, ”An algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operations,”Mathematical Programming 47 (1990) 175–201. · Zbl 0708.90047 · doi:10.1007/BF01580859
[24] R.J. Vanderbei, M.S. Meketon and B.A. Freedman, ”A modification of Karmarkar’s linear programming algorithm,”Algorithmica 1 (1986) 395–407. · Zbl 0626.90056 · doi:10.1007/BF01840454
[25] Y. Ye, ”Interior algorithms for linear, quadratic and linearly constrained convex problems,” Ph.D. Thesis (Chapter 5), Department of Engineering-Economic Systems, Stanford University (Stanford, CA, 1987).
[26] Y. Ye, ”An O(n 3 L) potential reduction algorithm for linear programming,”Mathematical Programming 50 (1991) 239–258. · Zbl 0734.90057 · doi:10.1007/BF01594937
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.