Interior-point methods with decomposition for solving large-scale linear programs

Journal of Optimization Theory and Applications

Volumn 102, Issue 1, 1999, Pages 169-192

  Zhao, G Y ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Algorithmic complexity; Dantzig Wolfe decomposition; Interior point methods; Large scale linear programming

Indexed keywords

COMPUTATIONAL COMPLEXITY; PARALLEL PROCESSING SYSTEMS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

ALGORITHMIC COMPLEXITY; DANTZIG-WOLFE DECOMPOSITION; DECOMPOSITION TECHNIQUE; INTERIOR-POINT METHOD; LARGE-SCALE LINEAR PROGRAMMING; LARGE-SCALE LINEAR PROGRAMMING PROBLEMS; LARGE-SCALES; LINEAR PROGRAMS; LINEAR-PROGRAMMING; SUB-PROBLEMS;

LINEAR PROGRAMMING;

EID: 0033246170     PISSN: 00223239     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021850714072     Document Type: Article

References (16)

1. DANTZIG, G. B., Linear Programming and Extensions, Princeton University Press, Princeton, New Jersey, 1963.
2. GOFFIN, J. L., HAURIE, A., and VIAL, J. P., Decomposition and Nondifferentiable Optimization with the Projective Algorithm, Management Science, Vol. 38, pp. 284-302, 1992.
3. GOFFIN, J. L., LUO, Z. Q., and YE, Y., Complexity Analysis of an Interior Cutting Plane Method for Convex Feasibility Problems, SIAM Journal on Optimization, Vol. 63, pp. 638-652, 1996.
4. NESTEROV, Y., and NEMIROVSKII, A., Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, Pennsylvania, 1994.
5. SONNEVEND, G., A New Method for Solving a Set of Linear (Convex) Inequalities and Its Application for Identification and Optimization, Proceedings of the 5th IFAC-IFORS Conference, Budapest, Hungary, 1986; Edited by B. Martos, Pergamon Press, Oxford, England, 1987.
6. HIRIART-URRUTY, J. B., and LEMARÉCHAL, C., Convex Analysis and Minimization Algorithms, Vols. 1-2, Springer Verlag, Berlin, Germany, 1993.
7. KIWIEL, K. C., Approximation in Proximal Bundle Methods and Decomposition of Convex Programs, Journal of Optimization Theory and Applications, Vol. 84, pp. 529-548, 1995.
8. SCHRAMM, H., and ZOWE, J., A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conception Idea, Convergence Analysis, Numerical Results, SIAM Journal on Optimization, Vol. 2, pp. 121-152, 1992.
9. MARSTEN, R., SUBRAMANIAN, R., SALTZMAN, M., LUSTIG, I. J., and SHANNO, D., Interior-Point Methods for Linear Programming: Just Call Newton, Lagrange, and Fiacco and McCormick!, Interfaces, Vol. 20, pp. 105-116, 1990.
10. GONZAGA, C. C., Path Following Methods for Linear Programming, SIAM Review, Vol. 34, pp. 167-227, 1992.
11. MIZUNO, S., TODD, M. J., and YE, Y., On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming, Mathematics of Operations Research, Vol. 18, pp. 964-981, 1993.
12. ZHAO, G., and STOER, J., Estimating the Complexity of a Class of Path-Following Methods for Solving Linear Programming by Curvature Integrals, Applied Mathematics and Optimization, Vol. 27, pp. 85-103, 1993.
13. KOJIMA, M., MEGIDDO, N., MIZUNO, S., and SHINDOH, S., Horizontal and Vertical Decomposition in Interior-Point Methods for Linear Programs, Working Paper, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan, 1993.
14. BIRGE, J. R., and QI, L., Computing Block-Angular Karmarkar Projections with Applications to Stochastic Programming, Management Science, Vol. 34, pp. 1472-1479, 1988.
15. CHOI, I. C., and GOLDFARB, F., Exploiting Special Structure in a Primal-Dual Path-Following Algorithm, Mathematical Programming, Vol. 58, pp. 33-52, 1993.
16. TODD, M. J., Exploiting Special Structure in Karmarkar's Linear Programming Algorithm, Mathematical Programming, Vol. 41, pp. 97-113, 1988.