메뉴 건너뛰기




Volumn 60, Issue 2, 2012, Pages 275-285

Lagrangian duality and branch-and-bound algorithms for optimal power flow

Author keywords

Branch and bound; Global optimization; Lagrangian duality; Optimal power flow; Quadratic programming

Indexed keywords

BRANCH AND BOUNDS; BRANCH-AND-BOUND ALGORITHMS; DUALITY GAP; FEASIBLE SET; LAGRANGIAN DUAL PROBLEM; LAGRANGIAN DUALITY; LOWER BOUNDS; NUMERICAL EXPERIMENTS; OBJECTIVE FUNCTIONS; OPTIMAL POWER FLOW PROBLEM; OPTIMAL POWER FLOWS; OPTIMALITY; POWER SYSTEM ANALYSIS; STRONG DUALITY; TEST PROBLEM;

EID: 84861646861     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1110.1036     Document Type: Article
Times cited : (56)

References (45)
  • 1
    • 0013532015 scopus 로고    scopus 로고
    • An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
    • An, L. T. H. 2000. An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints. Math. Programming 87(3) 401-426.
    • (2000) Math. Programming , vol.87 , Issue.3 , pp. 401-426
    • An, L.T.H.1
  • 2
    • 23844446891 scopus 로고    scopus 로고
    • Logarithmic barrier-augmented Lagrangian function to the optimal power flow problem
    • DOI 10.1016/j.ijepes.2005.06.004, PII S0142061505000645
    • Baptista, E. C., E. A. Belati, G. R. M. da Costa. 2005. Logarithmic barrieraugmented Lagrangian function to the optimal power flow problem. Internat. J. Electr. Power Energy Systems 27(7) 528-532. (Pubitemid 41165553)
    • (2005) International Journal of Electrical Power and Energy Systems , vol.27 , Issue.7 , pp. 528-532
    • Baptista, E.C.1    Belati, E.A.2    Da Costa, G.R.M.3
  • 5
    • 33846333019 scopus 로고    scopus 로고
    • Subgradient methods
    • Accessed July 2010, Stanford University, Stanford, CA
    • Boyd, S., A. Mutapcic. 2008. Subgradient methods. Notes for EE364b. Accessed July 2010, http://www.stanford.edu/class/ee364b/lectures/ subgrad-method-notes.pdf. Stanford University, Stanford, CA.
    • (2008) Notes for EE364b
    • Boyd, S.1    Mutapcic, A.2
  • 6
    • 77956088231 scopus 로고    scopus 로고
    • Infeasibility detection and SQP methods for nonlinear optimization
    • Byrd, R. H., F. E. Curtis, J. Nocedal. 2010. Infeasibility detection and SQP methods for nonlinear optimization. SIAM J. Optim. 20(4) 2281-2299.
    • (2010) SIAM J. Optim. , vol.20 , Issue.4 , pp. 2281-2299
    • Byrd, R.H.1    Curtis, F.E.2    Nocedal, J.3
  • 7
    • 33846594334 scopus 로고    scopus 로고
    • Interior-point based algorithms for the solution of optimal power flow problems
    • DOI 10.1016/j.epsr.2006.05.003, PII S0378779606001209
    • Capitanescu, F., M. Glavic, D. Ernst, L. Wehenkel. 2007. Interior-point based algorithms for the solution of optimal power flow problems. Electric Power Systems Res. 77(5-6) 508-517. (Pubitemid 46186805)
    • (2007) Electric Power Systems Research , vol.77 , Issue.5-6 , pp. 508-517
    • Capitanescu, F.1    Glavic, M.2    Ernst, D.3    Wehenkel, L.4
  • 8
    • 0000767626 scopus 로고
    • Contribution to the economic dispatch problem
    • Carpentier, J. 1962. Contribution to the economic dispatch problem. Bull Soc. Francaise Electriciens 8(3) 431-447.
    • (1962) Bull Soc. Francaise Electriciens , vol.8 , Issue.3 , pp. 431-447
    • Carpentier, J.1
  • 10
    • 0022720167 scopus 로고
    • Decoupled optimal load flow using linear or quadratic programming
    • Contaxis, G. C., C. Delkis, G. Korres. 1986. Decoupled optimal power flow using linear or quadratic programming. IEEE Trans. Power Systems PWRS-1 1-7. (Pubitemid 16613395)
    • (1986) IEEE Transactions on Power Systems , vol.PWRS-1 , Issue.2 , pp. 1-7
    • Contaxis, G.C.1    Delkis, C.2    Korres, G.3
  • 11
    • 80052725989 scopus 로고    scopus 로고
    • A subspace minimization method for the trust-region step
    • Erway, J. B., P. E. Gill. 2009. A subspace minimization method for the trust-region step. SIAM J. Optim. 20(3) 1439-1461.
    • (2009) SIAM J. Optim. , vol.20 , Issue.3 , pp. 1439-1461
    • Erway, J.B.1    Gill, P.E.2
  • 14
    • 0004236492 scopus 로고
    • 2nd ed. The Johns Hopkins, University Press, Baltimore
    • Golub, G. H., C. F. van Loan. 1990. Matrix Computations. 2nd ed. The Johns Hopkins University Press, Baltimore.
    • (1990) Matrix Computations
    • Golub, G.H.1    Van Loan, C.F.2
  • 15
    • 0037252748 scopus 로고    scopus 로고
    • An inverse free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems
    • Golub, G. H., Q. Ye. 2002. An inverse free preconditioned Krylov subspace method for symmetric generalized eigenvalue problems. SIAM J. Sci. Comput. 24(1) 312-334.
    • (2002) SIAM J. Sci. Comput. , vol.24 , Issue.1 , pp. 312-334
    • Golub, G.H.1    Ye, Q.2
  • 16
    • 0033437435 scopus 로고    scopus 로고
    • Solving the trust-region subproblem using the Lanczos method
    • Gould, N. I. M., S. Lucidi, M. Roma, Ph. L. Toint. 1999. Solving the trust-region subproblem using the Lanczos method. SIAM J. Optim. 9(2) 504-525. (Pubitemid 129489293)
    • (1999) SIAM Journal on Optimization , vol.9 , Issue.2 , pp. 504-525
    • Gould, N.I.M.1    Lucidi, S.2    Roma, M.3    Toint, P.L.4
  • 17
    • 0036347958 scopus 로고    scopus 로고
    • Minimizing a quadratic over a sphere
    • Hager, W. W. 2001. Minimizing a quadratic over a sphere. SIAM J. Optim. 12(1) 188-208.
    • (2001) SIAM J. Optim. , vol.12 , Issue.1 , pp. 188-208
    • Hager, W.W.1
  • 18
    • 70450197168 scopus 로고    scopus 로고
    • An ellipsoidal branch and bound algorithm for global optimization
    • Hager, W. W., D. T. Phan. 2009. An ellipsoidal branch and bound algorithm for global optimization. SIAM J. Optim. 20(2) 740-758.
    • (2009) SIAM J. Optim. , vol.20 , Issue.2 , pp. 740-758
    • Hager, W.W.1    Phan, D.T.2
  • 20
    • 13844310611 scopus 로고    scopus 로고
    • A primal-dual interior-point method to solve the optimal power flow dispatching problem
    • Jabr, R. A. 2003. A primal-dual interior-point method to solve the optimal power flow dispatching problem. Optim. Engrg. 4(4) 309-336.
    • (2003) Optim. Engrg. , vol.4 , Issue.4 , pp. 309-336
    • Jabr, R.A.1
  • 21
    • 33747619180 scopus 로고    scopus 로고
    • Radial distribution load flow using conic programming
    • DOI 10.1109/TPWRS.2006.879234
    • Jabr, R. A. 2006. Radial distribution load flow using conic programming. IEEE Trans. Power Systems 21(3) 1458-1459. (Pubitemid 44263543)
    • (2006) IEEE Transactions on Power Systems , vol.21 , Issue.3 , pp. 1458-1459
    • Jabr, R.A.1
  • 22
    • 49249090734 scopus 로고    scopus 로고
    • Optimal power flow using an extended conic quadratic formulation
    • Jabr, R. A. 2008. Optimal power flow using an extended conic quadratic formulation. IEEE Trans. Power Systems 23(3) 1000-1008.
    • (2008) IEEE Trans. Power Systems , vol.23 , Issue.3 , pp. 1000-1008
    • Jabr, R.A.1
  • 23
    • 84856282519 scopus 로고    scopus 로고
    • Zero duality gap in optimal power flow problem
    • Lavaei, J., S. H. Low. 2012. Zero duality gap in optimal power flow problem. IEEE Trans. Power Systems 27(1) 92-107.
    • (2012) IEEE Trans. Power Systems , vol.27 , Issue.1 , pp. 92-107
    • Lavaei, J.1    Low, S.H.2
  • 24
    • 14844291547 scopus 로고    scopus 로고
    • A trust region interior point algorithm for optimal power flow problems
    • DOI 10.1016/j.ijepes.2004.12.001, PII S0142061505000219
    • Min, W., L. Shengsong. 2005. A trust region interior point algorithm for optimal power flow problems. Internat. J. Electr. Power Energy Systems 27(4) 293-300. (Pubitemid 40340009)
    • (2005) International Journal of Electrical Power and Energy Systems , vol.27 , Issue.4 , pp. 293-300
    • Min, W.1    Shengsong, L.2
  • 28
    • 84861599581 scopus 로고
    • Nonsmooth optimization
    • J. R. Birge, K. G. Murty, eds. University of Michigan Press, Ann Arbor MI
    • Rockafellar, R. T. 1994. Nonsmooth optimization. J. R. Birge, K. G. Murty, eds. Mathematical Programming: The State of the Art. University of Michigan Press, Ann Arbor, MI, 248-258.
    • (1994) Mathematical Programming: The State of the Art , pp. 248-258
    • Rockafellar, R.T.1
  • 29
    • 18044401847 scopus 로고    scopus 로고
    • A new matrix-free algorithm for the large-scale trust-region subproblem
    • Rojas, M., S. A. Santos, D. C. Sorensen. 2000. A new matrix-free algorithm for the large-scale trust-region subproblem. SIAM J. Optim. 11(3) 611-646.
    • (2000) SIAM J. Optim. , vol.11 , Issue.3 , pp. 611-646
    • Rojas, M.1    Santos, S.A.2    Sorensen, D.C.3
  • 30
    • 0029207591 scopus 로고
    • Optimal-power-flow solution by Newton's method applied to an augmented Lagrangian function
    • Santos, A., Jr., G. R. M. da Costa. 1995. Optimal-power-flow solution by Newton's method applied to an augmented Lagrangian function. Generation, Transmission, Distribution, IEE Proc. 142(1) 33-36.
    • (1995) Generation, Transmission, Distribution, IEE Proc. , vol.142 , Issue.1 , pp. 33-36
    • Santos Jr., A.1    Da Costa, G.R.M.2
  • 31
    • 0034135343 scopus 로고    scopus 로고
    • Variable target value method for nondifferentiable optimization
    • DOI 10.1016/S0167-6377(99)00063-2
    • Sherali, H. D., G. Choi, C. H. Tuncbilek. 2000. A variable target value method for nondifferentiable optimization. Oper. Res. Lett. 26(1) 1-8. (Pubitemid 32212479)
    • (2000) Operations Research Letters , vol.26 , Issue.1 , pp. 1-8
    • Sherali, H.D.1    Choi, G.2    Tuncbilek, C.H.3
  • 32
    • 0002252730 scopus 로고
    • Cut-off method with space extension in convex programming problems
    • Shor, N. Z. 1977. Cut-off method with space extension in convex programming problems. Cybernetics System Anal. 1 94-97.
    • (1977) Cybernetics System Anal. , vol.1 , pp. 94-97
    • Shor, N.Z.1
  • 34
    • 0031542396 scopus 로고    scopus 로고
    • Minimization of a large-scale quadratic function subject to a spherical constraint
    • Sorensen, D. C. 1997. Minimization of a large-scale quadratic function subject to a spherical constraint. SIAM J. Optim. 7(1) 141-161.
    • (1997) SIAM J. Optim. , vol.7 , Issue.1 , pp. 141-161
    • Sorensen, D.C.1
  • 35
    • 79955533978 scopus 로고    scopus 로고
    • Robust optimal power flow solution using trust region and interior-point methods
    • Sousa, A. A., G. L. Torres. 2011. Robust optimal power flow solution using trust region and interior-point methods. IEEE Trans. Power Systems 26(2) 487-499.
    • (2011) IEEE Trans. Power Systems , vol.26 , Issue.2 , pp. 487-499
    • Sousa, A.A.1    Torres, G.L.2
  • 36
    • 0033296299 scopus 로고    scopus 로고
    • Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones
    • Sturm, J. F. 1999. Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Methods Software 11(1-4) 625-653.
    • (1999) Optim. Methods Software , vol.11 , Issue.1-4 , pp. 625-653
    • Sturm, J.F.1
  • 37
    • 61349197442 scopus 로고    scopus 로고
    • A multilevel algorithm for solving the trust-region subproblem
    • Toint, P. L., D. Tomanos, M. Weber-Mendonca. 2009. A multilevel algorithm for solving the trust-region subproblem. Optim. Methods Software 24(2) 299-311.
    • (2009) Optim. Methods Software , vol.24 , Issue.2 , pp. 299-311
    • Toint, P.L.1    Tomanos, D.2    Weber-Mendonca, M.3
  • 38
    • 0032205601 scopus 로고    scopus 로고
    • AN interior-point method for nonlinear optimal power flow using voltage rectangular coordinates
    • Torres, G. L., V. H. Quintana. 1998. An interior-point method for nonlinear optimal power flow using voltage rectangular coordinates. IEEE Trans. Power Systems 13(4) 1211-1218. (Pubitemid 128749001)
    • (1998) IEEE Transactions on Power Systems , vol.13 , Issue.4 , pp. 1211-1218
    • Torres, G.L.1    Quintana, V.H.2
  • 40
    • 0023859559 scopus 로고
    • Optimal power flow solved with sequential reduced quadratic programming
    • van Amerongen, R. A. M. 1988. Optimal power flow solved with sequential reduced quadratic programming. Electr. Engrg. 71(3) 213-219.
    • (1988) Electr. Engrg. , vol.71 , Issue.3 , pp. 213-219
    • Van Amerongen, R.A.M.1
  • 41
    • 29144523061 scopus 로고    scopus 로고
    • On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
    • DOI 10.1007/s10107-004-0559-y
    • Wächter, A., L. T. Biegler. 2006. On the implementation of an interiorpoint filter line-search algorithm for large-scale nonlinear programming. Math. Programming 106(1) 25-57. (Pubitemid 41813168)
    • (2006) Mathematical Programming , vol.106 , Issue.1 , pp. 25-57
    • Wachter, A.1    Biegler, L.T.2
  • 44
    • 77649322506 scopus 로고    scopus 로고
    • Model predictive economic/environmental dispatch of power systems with intermittent resources
    • Calgary, Alberta, Canada
    • Xie, L., M. D. Ilic. 2009. Model predictive economic/environmental dispatch of power systems with intermittent resources. IEEE Power Energy Soc. General Meeting, Calgary, Alberta, Canada, 1-6.
    • (2009) IEEE Power Energy Soc. General Meeting , pp. 1-6
    • Xie, L.1    Ilic, M.D.2
  • 45
    • 0013438004 scopus 로고
    • Informational complexity and effective methods for the solution of convex extremal problems
    • (in Russian)
    • Yudin, D. B., A. S. Nemirovski. 1976. Informational complexity and effective methods for the solution of convex extremal problems. Ekonom. Mat. Metody. 12(2) 550-559 (in Russian).
    • (1976) Ekonom. Mat. Metody. , vol.12 , Issue.2 , pp. 550-559
    • Yudin, D.B.1    Nemirovski, A.S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.