메뉴 건너뛰기




Volumn 9, Issue 2, 2012, Pages 163-182

Solving generation expansion planning problems with environmental constraints by a bundle method

Author keywords

Bundle methods; Constrained optimization; Generation expansion planning; Nonsmooth convex optimization

Indexed keywords


EID: 84860641929     PISSN: 1619697X     EISSN: 16196988     Source Type: Journal    
DOI: 10.1007/s10287-012-0139-1     Document Type: Article
Times cited : (6)

References (18)
  • 1
    • 33745664042 scopus 로고    scopus 로고
    • Optimal expansion of a developing power system under the conditions of market economy and environmental constraints
    • Avetisyan M, Bayless D, Gnuni T (2006) Optimal expansion of a developing power system under the conditions of market economy and environmental constraints. Energy Econ 28: 455-466.
    • (2006) Energy Econ , vol.28 , pp. 455-466
    • Avetisyan, M.1    Bayless, D.2    Gnuni, T.3
  • 2
    • 0002313454 scopus 로고
    • Optimizing resource acquisition decisions by stochastic programming
    • Bienstock D, Shapiro J (1988) Optimizing resource acquisition decisions by stochastic programming. Manag Sci 34(7): 215-229.
    • (1988) Manag Sci , vol.34 , Issue.7 , pp. 215-229
    • Bienstock, D.1    Shapiro, J.2
  • 5
    • 33646971357 scopus 로고
    • Convergence of some algorithms for convex minimization
    • Correa R, Lemaréchal C (1993) Convergence of some algorithms for convex minimization. Math Program 62: 261-275.
    • (1993) Math Program , vol.62 , pp. 261-275
    • Correa, R.1    Lemaréchal, C.2
  • 6
    • 34548178455 scopus 로고    scopus 로고
    • Bundle-type methods for inexact data
    • Fábián C (2000) Bundle-type methods for inexact data. Central Eur J Oper Res 8: 35-55.
    • (2000) Central Eur J Oper Res , vol.8 , pp. 35-55
    • Fábián, C.1
  • 7
    • 44649129120 scopus 로고    scopus 로고
    • Handling CVaR objectives and constraints in two-stage stochastic models
    • Fábián C (2008) Handling CVaR objectives and constraints in two-stage stochastic models. Eur J Oper Res 191: 888-911.
    • (2008) Eur J Oper Res , vol.191 , pp. 888-911
    • Fábián, C.1
  • 10
    • 45749105960 scopus 로고    scopus 로고
    • A bundle-filter method for nonsmooth convex constrained optimization
    • Karas E, Ribeiro A, Sagastizábal C, Solodov M (2009) A bundle-filter method for nonsmooth convex constrained optimization. Math Program 116: 297-320.
    • (2009) Math Program , vol.116 , pp. 297-320
    • Karas, E.1    Ribeiro, A.2    Sagastizábal, C.3    Solodov, M.4
  • 11
    • 0003296464 scopus 로고
    • Methods of Descent for Nondifferentiable Optimization
    • Berlin: Springer
    • Kiwiel KC (1985) Methods of descent for nondifferentiable optimization. Lecture Notes in Mathematics, vol 1133. Springer, Berlin.
    • (1985) Lecture Notes in Mathematics , vol.1133
    • Kiwiel, K.C.1
  • 12
    • 34249923238 scopus 로고
    • Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
    • Kiwiel KC (1991) Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization. Math Program 52: 285-302.
    • (1991) Math Program , vol.52 , pp. 285-302
    • Kiwiel, K.C.1
  • 14
    • 34247545816 scopus 로고    scopus 로고
    • Introducing environmental constraints in generation expansion problems
    • Marcato R, Sagastizábal C (2007) Introducing environmental constraints in generation expansion problems. Numer Linear Algebra Appl 14: 357-368.
    • (2007) Numer Linear Algebra Appl , vol.14 , pp. 357-368
    • Marcato, R.1    Sagastizábal, C.2
  • 15
    • 0003108675 scopus 로고
    • A modification and extension of Lemaréchal's algorithm for nonsmooth minimization
    • Mifflin R (1982) A modification and extension of Lemaréchal's algorithm for nonsmooth minimization. Math Program Stud 17: 77-90.
    • (1982) Math Program Stud , vol.17 , pp. 77-90
    • Mifflin, R.1
  • 16
    • 0001844687 scopus 로고    scopus 로고
    • A quasi-second-order proximal bundle algorithm
    • Mifflin R (1996) A quasi-second-order proximal bundle algorithm. Math Program 73: 51-72.
    • (1996) Math Program , vol.73 , pp. 51-72
    • Mifflin, R.1
  • 17
    • 33144461315 scopus 로고    scopus 로고
    • An infeasible bundle method for nonsmooth convex constrained optimization without a penalty function or a filter
    • Sagastizábal C, Solodov MV (2005) An infeasible bundle method for nonsmooth convex constrained optimization without a penalty function or a filter. SIAM J Optim 16: 146-169.
    • (2005) SIAM J Optim , vol.16 , pp. 146-169
    • Sagastizábal, C.1    Solodov, M.V.2
  • 18
    • 0000091855 scopus 로고
    • A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results
    • Schramm H, Zowe J (1992) A version of the bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results. SIAM J Optim 2: 121-152.
    • (1992) SIAM J Optim , vol.2 , pp. 121-152
    • Schramm, H.1    Zowe, J.2


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