Characterizations of robust solution set of convex programs with uncertain data
dc.contributor.author | Li, X. | |
dc.contributor.author | Wang, Song | |
dc.date.accessioned | 2018-02-06T06:14:00Z | |
dc.date.available | 2018-02-06T06:14:00Z | |
dc.date.created | 2018-02-06T05:49:53Z | |
dc.date.issued | 2017 | |
dc.identifier.citation | Li, X. and Wang, S. 2017. Characterizations of robust solution set of convex programs with uncertain data. Optimization Letters: pp. 1-16. | |
dc.identifier.uri | http://hdl.handle.net/20.500.11937/62847 | |
dc.identifier.doi | 10.1007/s11590-017-1187-9 | |
dc.description.abstract |
© 2017 Springer-Verlag GmbH Germany In this paper, we study convex programming problems with data uncertainty in both the objective function and the constraints. Under the framework of robust optimization, we employ a robust regularity condition, which is much weaker than the ones in the open literature, to establish various properties and characterizations of the set of all robust optimal solutions of the problems. These are expressed in term of subgradients, Lagrange multipliers and epigraphs of conjugate functions. We also present illustrative examples to show the significances of our theoretical results. | |
dc.publisher | Springer Verlag | |
dc.title | Characterizations of robust solution set of convex programs with uncertain data | |
dc.type | Journal Article | |
dcterms.source.startPage | 1 | |
dcterms.source.endPage | 16 | |
dcterms.source.issn | 1862-4472 | |
dcterms.source.title | Optimization Letters | |
curtin.department | School of Electrical Engineering, Computing and Mathematical Science (EECMS) | |
curtin.accessStatus | Fulltext not available |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |