File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A smoothing SQP method for nonlinear programs with stability constraints arising from power systems

TitleA smoothing SQP method for nonlinear programs with stability constraints arising from power systems
Authors
KeywordsConvergence
Nonlinear programs
Power systems
Smoothing SQP method
Stability constraint
Issue Date2012
PublisherSpringer New York LLC. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0926-6003
Citation
Computational Optimization And Applications, 2012, v. 51 n. 1, p. 175-197 How to Cite?
AbstractThis paper investigates a new class of optimization problems arising from power systems, known as nonlinear programs with stability constraints (NPSC), which is an extension of ordinary nonlinear programs. Since the stability constraint is described generally by eigenvalues or norm of Jacobian matrices of systems, this results in the semismooth property of NPSC problems. The optimal conditions of both NPSC and its smoothing problem are studied. A smoothing SQP algorithm is proposed for solving such optimization problem. The global convergence of algorithm is established. A numerical example from optimal power flow (OPF) is done. The computational results show efficiency of the new model and algorithm. © The Author(s) 2010.
Persistent Identifierhttp://hdl.handle.net/10722/144895
ISSN
2015 Impact Factor: 1.444
2015 SCImago Journal Rankings: 1.481
ISI Accession Number ID
Funding AgencyGrant Number
Natural Science Foundation of ChinaNSF10871031
10926189
Hong Kong Research Grant Council
Research Grants CouncilHKU7179/07E
HKU7180/08E
Union Natural Science Foundation of Hunan-Hengyang10JJ8008
Funding Information:

This work is supported by Natural Science Foundation of China (NSF10871031,10926189), the Hong Kong Research Grant Council, the Research Grants Council under Grant (HKU7179/07E, HKU7180/08E), and the Union Natural Science Foundation of Hunan-Hengyang (10JJ8008).

References

 

DC FieldValueLanguage
dc.contributor.authorTong, Xen_HK
dc.contributor.authorQi, Len_HK
dc.contributor.authorWu, SYen_HK
dc.contributor.authorWu, FFen_HK
dc.date.accessioned2012-02-21T05:44:06Z-
dc.date.available2012-02-21T05:44:06Z-
dc.date.issued2012en_HK
dc.identifier.citationComputational Optimization And Applications, 2012, v. 51 n. 1, p. 175-197en_HK
dc.identifier.issn0926-6003en_HK
dc.identifier.urihttp://hdl.handle.net/10722/144895-
dc.description.abstractThis paper investigates a new class of optimization problems arising from power systems, known as nonlinear programs with stability constraints (NPSC), which is an extension of ordinary nonlinear programs. Since the stability constraint is described generally by eigenvalues or norm of Jacobian matrices of systems, this results in the semismooth property of NPSC problems. The optimal conditions of both NPSC and its smoothing problem are studied. A smoothing SQP algorithm is proposed for solving such optimization problem. The global convergence of algorithm is established. A numerical example from optimal power flow (OPF) is done. The computational results show efficiency of the new model and algorithm. © The Author(s) 2010.en_HK
dc.languageengen_US
dc.publisherSpringer New York LLC. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=0926-6003en_HK
dc.relation.ispartofComputational Optimization and Applicationsen_HK
dc.rightsThe Author(s)en_US
dc.rightsCreative Commons: Attribution 3.0 Hong Kong Licenseen_US
dc.subjectConvergenceen_HK
dc.subjectNonlinear programsen_HK
dc.subjectPower systemsen_HK
dc.subjectSmoothing SQP methoden_HK
dc.subjectStability constrainten_HK
dc.titleA smoothing SQP method for nonlinear programs with stability constraints arising from power systemsen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4551/resserv?sid=springerlink&genre=article&atitle=A smoothing SQP method for nonlinear programs with stability constraints arising from power systems&title=Computational Optimization and Applications&issn=09266003&date=2012-01-01&volume=51&issue=1& spage=175&authors=Xiaojiao Tong, Liqun Qi, Soon-Yi Wu, <i>et al.</i>en_US
dc.identifier.emailWu, FF: ffwu@eee.hku.hken_HK
dc.identifier.authorityWu, FF=rp00194en_HK
dc.description.naturepublished_or_final_versionen_US
dc.identifier.doi10.1007/s10589-010-9348-0en_HK
dc.identifier.scopuseid_2-s2.0-84857193133en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-84857193133&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume51en_HK
dc.identifier.issue1en_HK
dc.identifier.spage175en_HK
dc.identifier.epage197en_HK
dc.identifier.eissn1573-2894en_US
dc.identifier.isiWOS:000298854000007-
dc.publisher.placeUnited Statesen_HK
dc.description.otherSpringer Open Choice, 21 Feb 2012en_US
dc.identifier.scopusauthoridTong, X=12242993600en_HK
dc.identifier.scopusauthoridQi, L=7202149952en_HK
dc.identifier.scopusauthoridWu, SY=12770034700en_HK
dc.identifier.scopusauthoridWu, FF=7403465107en_HK
dc.identifier.citeulike7774932-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats