Characterizations of robust solution set of convex programs with uncertain data
MetadataShow full item record
© 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.
Showing items related by title, author, creator and subject.
Nurunnabi, Abdul; Belton, David; West, Geoff (2012)Objectives: Surface reconstruction and fitting for geometric primitives and three Dimensional (3D) modeling is a fundamental task in the field of photogrammetry and reverse engineering. However it is impractical to get ...
Huo, Jiaquan (2004)The main theme of this thesis is the control of acoustic echoes for modem voice communication systems by means of echo cancellation. Two important issues in acoustic echo cancellation, namely the efficient adaptation of ...
Pham, DucSon; Venkatesh, S. (2013)Compressed sensing (CS) is an important theory for sub-Nyquist sampling and recovery of compressible data. Recently, it has been extended to cope with the case where corruption to the CS data is modelled as impulsive ...