Abstract
A new interior point quadratic programming algorithm which can solve power system optimization problems with significantly less computational efforts is presented. Since the formula of this method have been deduced more generally, it can start from either a feasible (interior point) or an infeasible point (non-interior point). In a study, numerical results have verified that the proposed algorithm possesses enough robustness and needs significantly less solution time.
| Original language | English |
|---|---|
| Title of host publication | IEEE Power Industry Computer Applications Conference |
| Place of Publication | Piscataway, NJ, United States |
| Publisher | IEEE |
| Pages | 98-104 |
| Number of pages | 7 |
| Publication status | Published - 1995 |
| Event | Proceedings of the 1995 IEEE Power Industry Computer Application Conference - Salt Lake City, UT, USA Duration: 1995 May 7 → 1995 May 12 |
Other
| Other | Proceedings of the 1995 IEEE Power Industry Computer Application Conference |
|---|---|
| City | Salt Lake City, UT, USA |
| Period | 95/5/7 → 95/5/12 |
ASJC Scopus subject areas
- Hardware and Architecture
- Electrical and Electronic Engineering