Characterizing Robust Solution Sets of Convex Programs under Data Uncertainty

Robust SOS-convex polynomial optimization problems: exact SDP relaxations

(2014) V. Jeyakumar et al.   Optimization Letters

Dual Semidefinite Programs Without Duality Gaps for a Class of Convex Minimax Programs

(2013) V. Jeyakumar et al.   JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS

Robust linear semi-infinite programming duality under uncertainty

(2013) M. A. Goberna et al.   MATHEMATICAL PROGRAMMING

Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty

(2012) V. Jeyakumar et al.   JOURNAL OF MATHEMATICAL ANALYSIS AND APPLICATIONS

Exact SDP relaxations for classes of nonlinear semidefinite programming problems

(2012) V. Jeyakumar et al.   OPERATIONS RESEARCH LETTERS

Characterizations of the solution set for a class of nonsmooth optimization problems

(2012) Ke Quan Zhao et al.   Optimization Letters

A convex polynomial that is not sos-convex

(2011) Amir Ali Ahmadi et al.   MATHEMATICAL PROGRAMMING

Theory and Applications of Robust Optimization

(2011) Dimitris Bertsimas et al.   SIAM REVIEW

Characterizing robust set containments and solutions of uncertain linear programs without qualifications

(2010) V. Jeyakumar et al.   OPERATIONS RESEARCH LETTERS

Strong Duality in Robust Convex Programming: Complete Characterizations

(2010) V. Jeyakumar et al.   SIAM JOURNAL ON OPTIMIZATION

Semidefinite representation of convex sets

(2008) J. William Helton et al.   MATHEMATICAL PROGRAMMING

Duality in robust optimization: Primal worst equals dual best

(2008) Amir Beck et al.   OPERATIONS RESEARCH LETTERS

Characterizations of solution sets of mathematical programs in terms of Lagrange multipliers

(2008) C.S. Lalitha et al.   OPTIMIZATION

Characterizations of optimal solution sets of convex infinite programs

(2008) T. Q. Son et al.   Top