An alternating direction search algorithm for low dimensional optimization: an application to power flow
Presented in this paper is a scheme for minimizing the cost function of a three-source technique to arrive at an approximation point (I,J) that is within one unit of the true minimum. The Line-Step algorithm is applied to several systems and is also compared to other minimization techniques, includ...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | en |
Published: |
Virginia Tech
2014
|
Subjects: | |
Online Access: | http://hdl.handle.net/10919/46240 http://scholar.lib.vt.edu/theses/available/etd-12162009-020216/ |
id |
ndltd-VTETD-oai-vtechworks.lib.vt.edu-10919-46240 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-VTETD-oai-vtechworks.lib.vt.edu-10919-462402021-05-15T05:26:30Z An alternating direction search algorithm for low dimensional optimization: an application to power flow Burrell, Tinal R. Mathematics Herdman, Terry L. Burns, John A. Cliff, Eugene M. Broadwater, Robert P. Gunzburger, Max D. LD5655.V855 1993.B873 Algorithms Electric power distribution Mathematical optimization Presented in this paper is a scheme for minimizing the cost function of a three-source technique to arrive at an approximation point (I,J) that is within one unit of the true minimum. The Line-Step algorithm is applied to several systems and is also compared to other minimization techniques, including the Equal Incremental Loss Algorithm. Variations are made on the Line-Step Algorithm for faster convergence and also to handle inequality constraints. Master of Science 2014-03-14T21:51:31Z 2014-03-14T21:51:31Z 1993-05-05 2009-12-16 2009-12-16 2009-12-16 Thesis Text etd-12162009-020216 http://hdl.handle.net/10919/46240 http://scholar.lib.vt.edu/theses/available/etd-12162009-020216/ en OCLC# 28514126 LD5655.V855_1993.B873.pdf vi, 64 leaves BTD application/pdf application/pdf Virginia Tech |
collection |
NDLTD |
language |
en |
format |
Others
|
sources |
NDLTD |
topic |
LD5655.V855 1993.B873 Algorithms Electric power distribution Mathematical optimization |
spellingShingle |
LD5655.V855 1993.B873 Algorithms Electric power distribution Mathematical optimization Burrell, Tinal R. An alternating direction search algorithm for low dimensional optimization: an application to power flow |
description |
Presented in this paper is a scheme for minimizing the cost function of a three-source technique to arrive at an approximation point (I,J) that is within one unit of the true minimum. The Line-Step algorithm is applied to several systems and is also compared to other minimization techniques, including the Equal Incremental Loss Algorithm. Variations are made on the Line-Step Algorithm for faster convergence and also to handle inequality constraints. === Master of Science |
author2 |
Mathematics |
author_facet |
Mathematics Burrell, Tinal R. |
author |
Burrell, Tinal R. |
author_sort |
Burrell, Tinal R. |
title |
An alternating direction search algorithm for low dimensional optimization: an application to power flow |
title_short |
An alternating direction search algorithm for low dimensional optimization: an application to power flow |
title_full |
An alternating direction search algorithm for low dimensional optimization: an application to power flow |
title_fullStr |
An alternating direction search algorithm for low dimensional optimization: an application to power flow |
title_full_unstemmed |
An alternating direction search algorithm for low dimensional optimization: an application to power flow |
title_sort |
alternating direction search algorithm for low dimensional optimization: an application to power flow |
publisher |
Virginia Tech |
publishDate |
2014 |
url |
http://hdl.handle.net/10919/46240 http://scholar.lib.vt.edu/theses/available/etd-12162009-020216/ |
work_keys_str_mv |
AT burrelltinalr analternatingdirectionsearchalgorithmforlowdimensionaloptimizationanapplicationtopowerflow AT burrelltinalr alternatingdirectionsearchalgorithmforlowdimensionaloptimizationanapplicationtopowerflow |
_version_ |
1719404700629991424 |