Publication Cover
Optimization
A Journal of Mathematical Programming and Operations Research
Volume 63, 2014 - Issue 5
254
Views
10
CrossRef citations to date
0
Altmetric
Articles

Strong duality in robust semi-definite linear programming under data uncertainty

&
Pages 713-733 | Received 06 Dec 2011, Accepted 30 Apr 2012, Published online: 01 Jun 2012

References

  • Beck , A and Ben-Tal , A . 2009 . Duality in robust optimization: Primal worst equals dual best . Oper. Res. Lett. , 37 : 1 – 6 .
  • Ben-Tal , A , Ghaoui , LE and Nemirovski , A . 2009 . Robust Optimization , New Jersey : Princeton Series in Applied Mathematics, Princeton University Press .
  • Ben-Tal , A and Nemirovski , A . 2003 . On Approximate Robust Counterparts of Uncertain Semi-definite and Conic Quadratic Programs, 20th IFIP Conference on System Modeling and Optimization, Vol. 130, (Trier, 2001) , 1 – 22 . Boston , , MA : Kluwer Academic .
  • Bertsimas , D and Brown , D . 2009 . Constructing uncertainty sets for robust linear optimization . Oper. Res. , 57 : 1483 – 1495 .
  • Bertsimas , D , Pachamanova , D and Sim , M . 2004 . Robust linear optimization under general norms . Oper. Res. Lett. , 32 : 510 – 516 .
  • Boyd , S and Vandenberghe , L . 2004 . Convex Optimization , Cambridge : Combridge University Press .
  • Ghaoui , LE , Oustry , F and Lebret , H . 1998 . Robust solutions to uncertain semi-definite programs . SIAM J. Optim. , 9 : 33 – 52 .
  • Goberna , MA . 2005 . “ Linear semi-infinite optimization: Recent advances ” . In Continuous Optimization , Edited by: Jeyakumar , V and Rubinov , AM . 3 – 22 . New York : Springer .
  • Goberna , MA , Jeyakumar , V , Li , G and Lopez , MA . 2012 . Robust linear semi-infinite programming duality under uncertainty . Math. Prog. Ser. B , (to appear)
  • Goberna , MA and López , MA . 1998 . Linear Semi-infinite Optimization , Chichester : Wiley .
  • Goldfarb , D and Iyengar , G . 2003 . Robust convex quadratically constrained programs . Math. Prog. Ser. B , 97 : 495 – 515 .
  • Jeyakumar , V . 2008 . Constraint qualifications characterizing Lagrangian duality in convex optimization . J. Optim. Theory Appl. , 136 : 31 – 41 .
  • Jeyakumar , V . 2008 . A note on strong duality in convex semi-definite optimization: Necessary and sufficient conditions . Optim. Lett. , 2 : 15 – 25 .
  • Jeyakumar , V and Lee , GM . 2008 . Complete characterizations of stable Farkas' lemma and cone-convex programming duality . Math. Program. , 114 : 335 – 347 .
  • Jeyakumar , V and Li , G . 2010 . Characterizing robust set containments and solutions of uncertain linear programs without qualifications . Oper. Res. Lett. , 38 : 188 – 194 .
  • Jeyakumar , V and Li , G . 2010 . Strong duality in robust convex programming: Complete charaCterizations . SIAM J. Optim. , 20 : 3384 – 3407 .
  • Jeyakumar , V and Wolkowicz , H . 1992 . Generalizations of Slater's constraint qualification for infinite convex programs . Math. Program. Ser. B , 57 : 85 – 101 .
  • Pinar , MC and Tutuncu , RH . 2005 . Robust profit opportunities in risky financial portfolios . Oper. Res. Lett. , 33 : 331 – 340 .
  • Recht , B , Fazel , M and Parrilo , PA . 2010 . Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization . SIAM Rev. , 52 : 471 – 501 .
  • Scherer , CW . 2005 . Relaxations for robust linear matrix inequality problems with verifications for exactness . SIAM J. Matrix Anal. Appl. , 27 : 365 – 395 .
  • Shapiro , A , Dentcheva , D and Ruszczynski , A . 2009 . Lectures on Stochastic Programming: Modeling and Theory , Philadelphia : SIAM .
  • Wolkowicz , H , Saigal , R and Vandenberghe , L . 2000 . Handbook of Semi-definite Programming: Theory, Algorithms, and Applications , Boston , , MA : Kluwer Academic .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.