Abstract
In this paper we list several useful properties of central points in linear programming problems. We study the logarithmic barrier function, the analytic center and the central path, relating the proximity measures and scaled Euclidean distances defined for the primal and primal–dual problems. We study the Newton centering steps, and show how large the short steps used in path following algorithms can actually be, and what variation can be ensured for the barrier function in each iteration of such methods. We relate the primal and primal–dual Newton centering steps and propose a primal-only path following algorithm for linear programming.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I. Adler and R.D.C. Monteiro, Limiting behavior of the affine scaling continuous trajectories for linear programming problems, Math. Programming 50 (1991) 29–51.
J.L. Goffin, Z.Q. Luo and Y. Ye, Complexity analysis of an interior cutting plane method for convex feasibility problems, SIAM J. Optim. 6 (1996) 638–652.
J.L. Goffin and J.P. Vial, Cutting planes and column generation techniques with the projective algorithm, J. Optim. Theory Appl. 65 (1990) 409–429.
J.L. Goffin and J.P. Vial, Shallow, deep and very deep cuts in the analytic center cutting plane method, Technical Report 96–3, Department of Management Studies, University of Geneva, Geneve, Switzerland (1996).
C.C. Gonzaga, An algorithm for solving linear programming problems in O(n 3 L) operations, in: Progress in Mathematical Programming: Interior Point and Related Methods, ed. N. Megiddo (Springer, New York, 1989) pp. 1–28.
C.C. Gonzaga, Path following methods for linear programming, SIAM Rev. 34 (1992) 167–227.
C.C. Gonzaga, Search directions for interior linear programming methods, Algorithmica 6 (1991) 153–181.
C.C. Gonzaga, The largest step path following algorithm for monotone linear complementarity problems, Math. Programming 76 (1997) 309–332.
C.C. Gonzaga and M. Cardia, Using the central path for computing the analytic center of a polytope, Technical Report, Department of Mathematics, Federal University of Santa Catarina, Florianópolis, Brazil (2000).
O. Güler, Limiting behavior of the weighted central paths in linear programming, Math. Programming 65 (1994) 247–382.
M. Iri and H. Imai, A multiplicative barrier function method for linear programming, Algorithmica 1 (1986) 455–482.
K.A. McShane, A superlinearly convergent O(√nL) iteration primal-dual linear programming algorithm, SIAM J. Optim. 4 (1994) 247–261.
N. Megiddo and M. Shub, Boundary behavior of interior point algorithms in linear programming, Math. Oper. Res. 14 (1989) 97–146.
S. Mizuno, M.J. Todd and Y. Ye, On adaptive step primal-dual interior-point algorithms for linear programming, Math. Oper. Res. 18 (1993) 964–981.
Y. Nesterov, Cutting plane algorithms from analytic centers: Efficiency estimates, Math. Programming 69 (1995) 149–176.
C. Roos, T. Terlaky and J.P. Vial, Theory and Algorithms for Linear Optimization: An Interior Point Approach (Wiley, Chichester, 1997).
R. Saigal, A three step quadratically convergent version of primal affine scaling method, J. Oper. Res. Soc. Japan 40 (1997) 310–328.
T. Tsuchiya and R.D.C. Monteiro, Superlinear convergence of the affine-scaling algorithm, Math. Programming 75 (1996) 77–110.
T. Tsuchiya, Quadratic convergence of the Iri-Imai algorithm for degenerate linear programming problems, J. Optim. Theory Appl. 87 (1995) 703–726.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gonzaga, C.C., Cardia, M. Properties of the Central Points in Linear Programming Problems. Numerical Algorithms 35, 185–204 (2004). https://doi.org/10.1023/B:NUMA.0000021776.38092.f6
Issue Date:
DOI: https://doi.org/10.1023/B:NUMA.0000021776.38092.f6