4.5 Article

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

相关参考文献

注意:仅列出部分参考文献,下载原文获取全部文献信息。
Article Mathematics, Applied

A COMPLETE CHARACTERIZATION OF THE GAP BETWEEN CONVEXITY AND SOS-CONVEXITY

Amir Ali Ahmadi et al.

SIAM JOURNAL ON OPTIMIZATION (2013)

Article Computer Science, Software Engineering

A convex polynomial that is not sos-convex

Amir Ali Ahmadi et al.

MATHEMATICAL PROGRAMMING (2012)

Article Operations Research & Management Science

Exact SDP relaxations for classes of nonlinear semidefinite programming problems

V. Jeyakumar et al.

OPERATIONS RESEARCH LETTERS (2012)

Article Mathematics, Applied

Theory and Applications of Robust Optimization

Dimitris Bertsimas et al.

SIAM REVIEW (2011)

Article Computer Science, Software Engineering

Semidefinite representation of convex sets

J. William Helton et al.

MATHEMATICAL PROGRAMMING (2010)

Article Mathematics, Applied

STRONG DUALITY IN ROBUST CONVEX PROGRAMMING: COMPLETE CHARACTERIZATIONS

V. Jeyakumar et al.

SIAM JOURNAL ON OPTIMIZATION (2010)

Article Mathematics

Farkas-type results for max-functions and applications

Radu I. Bot et al.

POSITIVITY (2006)

Article Operations Research & Management Science

A Frank-Wolfe type theorem for convex polynomial programs

EG Belousov et al.

COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2002)