Interior-point methods and their applications to power systems: a classification of publications and software codes

IEEE Transactions on Power Systems

Volumn 15, Issue 1, 2000, Pages 170-176

  Quintana, Victor H ^a   Torres, Geraldo L ^a   Medina Palomo, José ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE SELECTION AND EVALUATION; INTERNET; LINEAR ALGEBRA; ONLINE SEARCHING; OPTIMIZATION; THEOREM PROVING;

INTERIOR POINT METHODS THEORY; SOFTWARE CODES;

ELECTRIC POWER SYSTEMS;

EID: 0034139049     PISSN: 08858950     EISSN: None     Source Type: Journal    
DOI: 10.1109/59.852117     Document Type: Article

References (126)

1. E. R. Dames, "A variation on Karmarka's algorithm for solving linear programming problems," Mathematical Programming, vol. 3d, pp. 174-182, 1986.
2. R. H. Byrd, J. C, Gilbert, and J. Noccdal, "A trust region method based on interior point techniques for nonlinear programming," Computer Science Department, University of Colorado, Boulder, CO, Technical Report, May 1996.
3. R. H. Byrd, M. E. Hribar, and J. Nodal, "An interior point algorithm for large scale nonlinear programming," Computer Science Department, University of Colorado, Boulder, CO, Technical Report, July 1997.
4. T. J. Carpenter, I. J. Lustig, J. M, Mulvey, and D. F. Shanno, "Higher-order predictor-corrector interior point methods with applications to quadratic objectives," SIAM Journal on Optimization, vol. 3, pp. 696-725,1993.
5. 1.1. Dikin, "Iterative solution of problems of linear and quadratic programming1," Soviet Mathematics Doktady, vol. 8, pp. 674-675, 1967.
6. A. El-Bakry, R. Tapia, T. Tsuchiya, und Y. Zhang, "On the formulation and theory of the Newton interior-point method fur nonlinear prugramming," Journal of Optimization Theory and Applications, vol. 89, pp. 507-541, 1996.
7. A. V. Fiacco and G. P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques: John Wiley & Sons, 1968.
8. K, R. Frisch, "The logarithmic potential method of convex programming," University Institute of Economics, Oslo, Norway, Manuscript, 1955.
9. P. E. Gill and W. Murray, "On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projectivc method," Mathematical I'mgramming, vol. 36, pp. 183-209, 1986.
10. P. E. Gill, W. Murray, D. B. Ponceleön, and M. A. Saunders, "Primal-dual methods for linear programming," Mathematical Programming, vol. 70, pp. 251-277, 1995.
11. J. GondJ.io, "Multiple cenlrality corrections in a primal-dual method for linear programming," Computational Optimization and Applications, vol.6, pp. 137-156, 1996.
12. C, C. Gonzaga, "Path following methods for linear programming," SIAM Review, vol. 34, pp. 167-224, 1992.
13. N. Karmarkar, "A tiew polynomial-time algorithm for linear programming," Combinatorica, vol. 4, pp. 373-395, 1984.
14. L. G. Khachiyan, "A polynomial algorithm in linear programming," DnkladyAkademiiNaukSSSR,ml.Z24,pp. 1093-1096, 1979.
15. R. R. Marslen ami M. J. Salt/man, "Implementation of a dual affine interior point algorithm for linear programming," ORSA Journal on Computing, vol. 1, pp. 287-297, 1989.
16. N. Megiddo, "Pathways to the optimal set in linear programming," IBM Almaden Research Center, San Jose, CA, Technical Report RJ 5295, 1986.
17. S. Mehrotra, "On the implementation of a primal-dual interior point method," SIAM Journal on Optimization, vol. 2, pp. 575-601, 1992.
18. S. Mizuno and A. Nagasawa, "A primal-dual affine scaling potential-reduction algorithm for linear programming," Mathematical Programming, vol. 62, pp. 119-131, 1993.
19. R. Ü. C. Monteiro and I. Adler, "Interior path following primal-dual algorithms. Part 1: Linear programming," Mathematical Programming, val. 44, pp. 27-413, 1989.
20. -_, "Interior path following primal-dual algorithms. Part II: Convex quadratic programming," Mathematical Programming, vol. 44, pp. 43-66, 1989.
21. C. Rons, T, Terlaky, and I.-P, Vial, Theory ami Algorithm,for Linear O/>!iinizatiuii: An Interior Point Approach: John Wiley & Sons, 1997.
22. R. Saigal, Linear Programming: A Modern Integrated Analysis'. Kluwer Academic Publishers, 1995.
23. D. F. Slianno, M. G. Breitfeld, and E. M. Simantiraki, "Implementing barrier methods for nonlinear programming," Rulgers University, New Brunswick, NJ, Technical Report RRR 39-95, 1995.
24. M. Todd, "Potential reduction methods in mathematical programming," Cornell University, Ithaca, NY, Technical Report 1112, 1995.
25. M, H. Wright, "Interior methods for constrained optimization," in Acta Numerica, W. W. Hager, Ed: Kluwer Academic Publishers, 1991, pp. 341-407.
26. S. J. Wright, Primal-Dual interior-Point Methods: S1AM, 1997.
27. H. Yamashita and M. Yabe, "Superlinear and quadratic convergence of some primal-dual interior point methods for constrained optimization," Mathematical Programming, vol. 75, pp. 377-397, 1996.
28. I. Adler, N. Karrnarkar,M. G. C. Resende, aiul G. Veiga, "Data structures and programming techniques for (he implementation of Kannarkar's algorithm," ORSA Journal on Computing, vol. 1, pp. 84-106, 1989.
29. I. Adler, M. Resende, G. Veiga, and N. Karmarkar, "An implementation of Karmarkar's algorithm for linear programming," Mathematical Programming, vol. 44, pp. 297-335, 1989.
30. E. D. Andersen and K. D. Andersen, "Presolving in linear programming," Mathematical Programming, vol. 71, pp. 221-245, 1995.
31. E. D. Andersen, J. Gondzio, C. Mêsrfros, and X. Xu, "Implementation of interior point methods for large scale linear programming," Logilab, Section of Management Studies, University of Geneva, Geneva, Switzerland, Technical Report 1996.3, 1996.
32. R. C. Bixby, "Progress in linear programming," ORSA Journal on Computing, vol. 6, pp. 15-22, 1994.
33. A. R. Conn, N. I. M. Gould, and P. !.. Toint, IANCEI.OT: A Fortran Package far Large-Scale. Nonlinear Optimization (Release A). New York; Springer Verlag, 1992.
34. D. M. Gay, "Electronic mail distribution of linear programming test problems," Mathematical Programming Society COAL Newsletter, 1988.
35. J. Gondzio, "Presolve analysis of linear programs prior to applying Hie interior point method," Logilab, Section of Management Studies, University of Geneva, Geneva, Switzerland, Technical Report 1994.3, 1994.
36. _, "Warm start of the primal-dual method applied in the cutting plane scheme," Logilab, Section of Managenrent Studies, University of Geneva, Geneva, Switzerland, Technical Report 96.3, 1997,
37. J. Gondzio and J.-P. Vial, "Warm start and e-subgradients in cutting plane scheme for block-angular linear programs," Logilab, Section of Management Studies, University of Geneva, Geneva, Switzerland, Technical Report 1997.1, 1997.
38. W. Hock and K. Schittkowski, Test Examples far Nonlinear Programming Codes. New York, NY: Springer Verlag, 1981.
39. I.. S. Lasdon, J. Plumrner, and G. Yu, "Primal-dual and primal interior point algorithms for general nonlinear programs," ORSA Jour/ml on Computing, vol. 7, pp. 321-332, 1995.
40. E. K. Lee and J. E. Mitchell, "Computational experience of an interior-point SQP algorithm in a parallel branch-and-bound framework," in PI'UC, of High Performance Optimization Techniques: Springer Verlag, 1997.
41. L. 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, vol. 152, pp. 191-222, 1991.
42. _, "On implementing Mehrotra's predictor-corrector interior point method for linear programming," SIAM Journal on Optimization, vol. 2, pp. 435-449, 1992.
43. _, "Computational experience with a globally convergent primal-dual predictor-corrector algorithm for linear programming," Mathematical Programming, vol. 66, pp. (23-135, 1994.
44. _, "Interior point methods for linear programming: Computational state of the art," ORSA Journal on Computing, vol. 6, pp. 1-14, 1994.
45. K. A. McShane, C. L. Monma, and D. Shanno, "An implementation of a primal-dual interior point method for linear programming," ORSA Journal on Computing, vol. 1, pp. 70-83, 1989.
46. S. Mehrotra, "Implementations of affine scaling methods; Approximate solutions of systems of linear equations using preconditioned conjugate gradient methods," ORSA Journal on Computing, vol. 4, pp. 103-118, 1992.
47. C. Mészâros, "The efficient implementation of interior point methods for linear programming and their applications," Ph.D. dissertation, Eötvös Lonänd University of Sciences, Ph.D. School of Operations Research, Budapest, Hungary, 1996.
48. C. Mészâros, "On free variables in interior point methods," Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary, Technical Report, 1997.
49. C. Mészâros, "Steplengths in infeasible primal-dual interior point algorithms of convex quadratic programming," Imperial College, London, UK, Departmental Technical Report DOC 97/7, 1997.
50. J. K. Mitchell, "Computational experience with an interior point cutting plane algorithm," Mathematical Sciences, Rensselacr Polytechnic Institute, Troy, NY, Technical Report, Feb. 1997.
51. H. Miltlemann. (1997) Benchmarks for optimization software. [Online[http://plato.la.asu.edu/bench.html
52. B. A. Murtngh tuul M. A. Saunders, "MINOS5.4user's guide,"Systems Optimization Laboratory, Stanford University, Revised Feb. 1995,1983.
53. K. Schittkowski, More Test Examples for Nonlinear Programming Codes. New York, NY: Springer Verlag, 1987.
54. R. i. Vandcrbei, "ALPO: Another linear program optimizer," ORSA Journal on Computing, vol. 5, pp. 134-146, 1993.
55. _, "Interior puint methods: Algorithms and formulations," ORSA Journal on Computing, vol. 6, pp. 32-34, 199'!.
56. R. J. Vanderbei and D. F. Shanno, "An interior point algorithm for nonconvex nonlinear programming," School of Engineering and Operations Research, Princeton University, Princeton, NJ, Technical Report SOR-97-21, Nov. 1997.
57. X. Xu, P. Hung, and Y. Ye, "A simplified homogeneous and self-dual linear programming algorithm and its implementation," Annals of Operation Research, vol. 62, pp. 151-172, 1996.
58. K. D. Andersen, "A modified Schur-complement method for handling dense columns in interior-point methods for linear programming," ACM Trans, nn Mathematical Software, vol. 22, pp. 348-356, 1996.
59. J. R. Bunch, L. Kaufman, and B. N. Partett, "Decomposition of a symmetric matrix," Numetish Mathentatic, vol. 27, pp. 95-109, 1976.
60. J. R. Bunch anil D. N. Parlett, "Direct methods for solving symmetric indefinite systems of linear equations," SIAM Journal on Numerical Analysis, vol. 8, pp, 639-655, 1971.
61. S. Duff, A, M. Erisman, and J. K, Reid, Eds., Direct Methods for Sparse Matrices. New York: Oxford University Press, 1989.
62. A. Forsgren, P. E. Gill, and W. Murray, "Computing modified Newton directions using partial Cholesky factorizations," SIAM Journal on Scientific Computing, vol. 16, pp. 139-150, 1995.
63. A. Forsgren, P. E. Gill, and J. R, Shinnerl, "Stability of symmetric illconditioned systems arising in interior methods for constrained optimization," SIAM Journal on Matrix Analysis and Applications, vol. 17, pp. 187-211, 1996.
64. R, Fourer and S. Mehrotra, "Solving symmetric indefinite systems in an interior-point method for linear programm ing," Mathematical Programming, vol. 62, pp. 15-39, 1993.
65. A. George and J. W.-H. Liu, Computer Solution of Large Sparse Punitive Definite Systems: Prentice-Hall, 1981.
66. P. E. Gill, W. Murray, D. B. Ponccleon, and M. A, Saundei's, "Preconditioners for indefinite systems arising in optimization," SIAM Journal on Matrix Analysis and Applications, vol. 13, pp. 292-311, 1992.
67. P. E. Gill, M. A. Saunders, and J. R. Shinnerl, "On the stability of Cholesky factorization for symmetric quasidefinite systems," Department of Mathematics, University of California, San Diego/L:i Jolla, CA, Technical Report, 1996.
68. M. T. Jones and P. E. Plassmann, "An improved incomplete Cholesky factorization," ACM Trans, on Mathematical Software, vol. 21, pp. 5-19, 1995.
69. H. Jung, R. E. Marstcn, and M. J. Saltzman, "Numerical factorization methods for interior point algorithms,1 ORSA Journal on Computing, vol. 6, pp. 94-105, 1994.
70. A. Kennings, "Coll placemen! using constructive and iterative improvements methods," Ph.D. dissertation, Department of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada, 1997.
71. J. Liu, "The evolution of the minimum degree ordering algorithm," SIAM Review, vol. 33, pp. 1-19, 1989.
72. J. W. H. Liu, E. Ng, and B. W. Peyton, "On finding supei nodes for sparse matrix computations," SIAM Journal on Matrix Analysis and Applications, vol. 14, pp. 242-252, 1993.
73. I. Maros and C. Mészâros, "The role of the augmented system in interior point methods," Brunei, The University of West London, London, UK, Technical Report, Sop. 1996.
74. C. MesJ.4ros, "The "inexact" minimum local fill-in ordering algorithm," Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary, Technical Report, 1997.
75. E. Ng and B. W. Peyton, "Block sparse Cholesky algorithms on advanced uniprocessor computers," SIAM Journal on Scientific Computing, vol. 14, pp. 1034-1056, 1993.
76. M. G. C. Resende and G. Veiga, "An efficient implementation of a network interior point method," AT&T Bell Laboratories, Murray Hill, NJ, Technica! Report, Feb. 1992.
77. E. Rothberg and A. Gupta, "Efficient sparse matrix factorization on high-performance workstations-exploiting the memory hierarchy," ACM Trans, on Mathematical Software, vol. 17, pp. 313-334, 1991.
78. C. F. Van Loan and G. Gollub, Matrix Computations, 4th ed. London: Johns Hopkins, 1993.
79. R. J. Vanderbei, "Splitting dense columns in sparse linear systems," Linear Algebra and Its Applications, vol. 152, pp. 1U7-117, 1991.
80. _, "Symmetric quasidefinite matrices," SIAM Journal on Optimization, vol. 5, pp. 100-113, 1995.
81. R. J. Vanderbei and T. J. Carpenter, "Symmetric indefinite systems for interior point methods," Mathematical Programming, vol. 58, pp. 1-32, 1993.
82. S. Wright, "Stability of augmented system factorizations in interiorpoint methods," Argonne National Laboratory, Argone, IL, Manuscript, 1996.
83. E. D. Andersen and K. D. Andersen, "The APOS linear programming solver: An implementation of (he homogeneous algorithm," Department of Management, Odcnse University, Odense M, Denmark, Technical Report, Apr. 1997.
84. A. Brooke, D. Kendrick, and A. Mceraus, GAMS; A User's Guide: Scientific Press, 1988.
85. CPLEX Optimization, Inc., "Using the CPLEX Callable Library and CPLF.X Mixed Integer Library,", Incline Village, NV, 1993.
86. J. Czyzyk, S. Mehrotra, and S. J. Wright, "PCx user guide," Optimization Technology Center, Argonne National Laboratory, Technical Report OTC 96/01, May 1996.
87. (87] R. Fourer, D. M. Gay, and B. W. Kernighan, AMPL: A Modeling Language for Mathematical Programming: Scientific Press, 1993.
88. J, Gondzio, "HOPDM (version 2.12): A fust LP solver based on a primal-dual interior point method," European Journal of Operations Research, vol. 85, pp. 221-225, 1995.
89. IBM Corporation, Optimization Subroutine Library Guide and Referma, 2nd ed., 1991.
90. J. J. More and S, J. Wright, Optimization Software Guide: SIAM, 1993.
91. R. J. Vanderbei, "LOQO: An interior point code for quadratic programming," Princeton University, School of Engineering and Operations Research, Princeton, NJ, Technical Report, May 1997.
92. Y. Zhang, "Solving large-scale linear programs by interior-point methods under the MATLAB environment," Department of Mathematics and Statistics, Univeristy of Maryland, Baltimore County, MD, Technical Report TR96-01, Feb. 1996.
93. K. A. Clements, P. W. Davis, and K. D. Frey, "An interior point algorithm for weighted least absolute value power system state estimation," in 19911EEE/PES Winter Meeting, Paper no. 91 -WM 235-2 PWRS.
94. _, "Treatment of inequality constraints in power system state estimation," IEEE Trans, un Power Systems, vol. 10, pp. 567-573, 1995.
95. H. Singh and F. L. Alvarado, "Weighted least absolute value state estimation using interior point method," IEEE Trans, on Power Systems, vol. 9, pp. 1478-1484, 1994.
96. H. Singh, F. L. Alvarado, and W.-H. E. Lin, "Constrained LAV state estimation using penalty functions," IEEE Trans, on Power Systems, vol. 12, pp. 383-388, 1997.
97. H. Wei, H. Sasaki, J. Kubokawa, and R. Yokoyama, "An interior point method for power system weighted nonlinear h norm static state estimation," IEEE Trans, on Power System!, vol. 13, pp. 617-623, 1998.
98. G. Blancha, J.-C. Dodu, A. Renaud, and M. Bnuhtou, "Implementation of a primal-dual interior-point method applied to the planning of reactive power compensation devices," in Proc. of the 12th Power Systems Computation Conference, Dresden, Germany, Aug. 1996, pp. 827-836.
99. S. GranviUe, "Optimal reactive dispatch through interior point methods," IEEE Trans, nn Power Systems, vol. 9, pp, 136-146, 1994.
100. S. Granville, J. C. O. Mello, and A. C. G. Mclo, "Application of interior point methods to power flow unsolvability," IEEE Trans, on Power Systems, vol. 11, pp. I09Ö-1103, 1996.
101. G. D. Irisarri, L. M. Kimball, K. A. Clements, A. Bagchi, and P. W. Davis, "Economic dispatch with network and ramping constraints via interior point methods," in 1997IEEE/PES Summer Meeting, Paper no. PE-448-PWRS 0-04-1997.
102. G. D. Irisarri. X. Wang, J. Tong, and S. Mokhtari, "Maximum loadability of power systems using interior point nonlinear optimization method," IEEE Trnn.f. on Power Systems, vol. 12, pp. 162-172, 1997,
103. J. L. Marti'nez, A. Gome?., and V. H. Quintatia, "Reactive-power optimization by interior point methods: Implementation issues," in {'roc. of the 12th Power Systems Computation Conference, Germany, Aug. 1996, pp. 844-850.
104. J. Momoh, L. G. Dias, S. Quo, and R. Atlapa, "Economic operations and planning of multiarea interconnected power systems," IEEE Trans, on Pbwer Systems, vol. 10, pp. 1044-1053, 1995.
105. J. Momoh, S. Guo, E. Ogbuobiri, and R. Adapa, "The quadratic interior point method for solving power systems optimization problems," IEEE Trans, on Power Systems, vol. 9, pp. 1327-1336, 1994.
106. G. L. Torres and V. H. Quintana, "An interior point method for nonlinear optimal power flow using voltage rectangular coordinates," IEEE Trans, on Power Systems, to be published.
107. _, "Rectangular and polar form optimal power flow by a primal-dual interior-point method for nonlinear programming," Dept, of Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada, Technical Report UW E & CE 97-13, 1997.
108. L. Vargas, V. Quintana, and A. Vannelli, "A tutorial description of an interior-point method and its application lo security constrained economic dispatch,"/E££7ranj-. on Power Systems, vol. 11,pp. 1315-1324, 1993.
109. H. Wei, H. Sasaki, and R. Yokoyama, "An application of interior point quadratic programming algorithm to power system optimization problems," IEEE Trans, on Power Systems, vol. II, pp. 260-266, 1996.
110. _, "An interior point nonlinear programming for optimal powet How problems with a novel data structure," IEEE Trans, on Power Systems, vol. 13, pp. 870-877, 1998.
111. Y. Wu, A. S. Debs, and R. K. Marsten, "A direct nonlinear predictorcorrector primal-dual interior point algorithm for optimal power flow," IEEE Trans, on Power Systems, vol. 9, pp. 876-883, 1994.
112. X. Yan and V, H. Quintana, "Improving an interior-point-based OPE by dynamic adjustments of step sizes and tolerances," IBEE Trans, on Power Systems, to be published.
113. _, "An infeasible interior-point algorithm for optimal power flow problems," Electric Power Systems Research Journal, tu be published.
114. _, "An efficient predictor-corrector interior point algorithm for security-constrained economic dispatch," IEEE Trans, on Power Systems, vol. 12, pp. 803-810, 1991.
115. M. Christoforodis et al., "Long-term/mid-term resource optimization of a hydro-dominant power system using interior point method," IEEE Trans, on Power Systems, vol. II, pp. 287-294, 1996.
116. J. Medina, V. H. Qnimana, A. Conejo, and F. P. ThorJen, "A new clipping-off interior-point algorithm to solve the medium-term hydro-thermal coordination problem," in Pmc. of the {997 IEEK Canadian Conference nn Electrical anil Camputer Engineering, May 1997, pp. 285-288.
117. _, "A comparison of interior-point codes for medium-term hydro-thermal coordination," IEEE Tram, nn Pnwer Systems, vol. 13, pp. 836-843, 1998.
118. J. Medina, V. H. Quintana, 'and A. J. Conejo, "A clipping-off interiorpoint technique for medium-term hydro-thermal coordination," IEEE Trans, on Power Systems, to he published.
119. H. Wei, H. Sasaki, and J. Kubokawa, "A decoupled solution of hydrothermal optimal power How problem by means of interior point method and network programming," IEEE Trans, on Power Systems, vol. 13, pp. 286-293, 1998.
120. C. N. Lu and M. R. Unum, "Network constrained security control using an interior point algorithm," IF.EE Trans, on Power Systems, vol. 8, pp. 1068-1076, 1993.
121. J- C. O. Mello, A. C. G. Melo, and S. Granville, "Simultaneous transfer capability assesment by combining interior point methods and Monte Carlo simulation," IEEE Trans, on Power Systems, vol. 12, pp. 73Ü-742, 1997.
122. A. C. G. Melo, J. C. 0. Mello, and S. Granville, 'The effects of voltage collapse problems in the reliability evaluation of composite systems," IEEE Trans, cm Power Systems, vol, 12, pp, 480-488, 1997.
123. K. Pannambalain, V. H. Quintana, and A. Vannelli, "A fast algorithm for power system optimization problems using an interior point method," IEEE Tran,-:, on Power Systems, vol. 7, pp. 892-899, 1992.
124. V. R. Sherkat and Y. Jkunt, "Experience with interior point optimization software for a fuel planning application," IEEE Trans, on Ptiwer Systems, vol. 9, pp. 833-840, 1994.
125. X. Wang, G. C. Ejebe, J. long, and J. G. Waight, "Preventive/corrective control for voltage stability using direct interior point method," IEEE Trans, on Power Systems, vol. 13, pp. 878-883, 1998.
126. L. G. Khachiyan, "A polynomial algorithm in linear programming" (in English version), Soviet Methfintttics Dnklady, vol. 20, pp. 191-194, 1979.