Robust SOS-convex polynomial optimization problems: exact SDP relaxations

Robust linear semi-infinite programming duality under uncertainty

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

Optimality conditions and finite convergence of Lasserre’s hierarchy

(2013) Jiawang Nie   MATHEMATICAL PROGRAMMING

Robust best approximation with interpolation constraints under ellipsoidal uncertainty: Strong duality and nonsmooth Newton methods

(2013) V. Jeyakumar et al.   NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS

A convex polynomial that is not sos-convex

(2011) Amir Ali Ahmadi et al.   MATHEMATICAL PROGRAMMING

On the Lasserre Hierarchy of Semidefinite Programming Relaxations of Convex Polynomial Optimization Problems

(2011) Etienne de Klerk et al.   SIAM JOURNAL ON OPTIMIZATION

Theory and Applications of Robust Optimization

(2011) Dimitris Bertsimas et al.   SIAM REVIEW

Strong Duality in Robust Convex Programming: Complete Characterizations

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

Convexity in SemiAlgebraic Geometry and Polynomial Optimization

(2009) Jean B. Lasserre   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