相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。Constraint qualifications in linear vector semi-infinite optimization
M. A. Goberna et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2013)
A COMPLETE CHARACTERIZATION OF THE GAP BETWEEN CONVEXITY AND SOS-CONVEXITY
Amir Ali Ahmadi et al.
SIAM JOURNAL ON OPTIMIZATION (2013)
A convex polynomial that is not sos-convex
Amir Ali Ahmadi et al.
MATHEMATICAL PROGRAMMING (2012)
Exact SDP relaxations for classes of nonlinear semidefinite programming problems
V. Jeyakumar et al.
OPERATIONS RESEARCH LETTERS (2012)
Necessary global optimality conditions for nonlinear programming problems with polynomial constraints
V. Jeyakumar et al.
MATHEMATICAL PROGRAMMING (2011)
A robust von Neumann minimax theorem for zero-sum games under bounded payoff uncertainty
V. Jeyakumar et al.
OPERATIONS RESEARCH LETTERS (2011)
Semidefinite representation of convex sets
J. William Helton et al.
MATHEMATICAL PROGRAMMING (2010)
STRONG DUALITY IN ROBUST CONVEX PROGRAMMING: COMPLETE CHARACTERIZATIONS
V. Jeyakumar et al.
SIAM JOURNAL ON OPTIMIZATION (2010)
Duality in robust optimization: Primal worst equals dual best
Amir Beck et al.
OPERATIONS RESEARCH LETTERS (2009)
Necessary and sufficient conditions for S-lemma and nonconvex quadratic optimization
Vaithilingam Jeyakumar et al.
OPTIMIZATION AND ENGINEERING (2009)
ALTERNATIVE THEOREMS FOR QUADRATIC INEQUALITY SYSTEMS AND GLOBAL QUADRATIC OPTIMIZATION
V. Jeyakumar et al.
SIAM JOURNAL ON OPTIMIZATION (2009)
New sequential Lagrange multiplier conditions characterizing optimality without constraint qualification for convex programs
V Jeyakumar et al.
SIAM JOURNAL ON OPTIMIZATION (2003)
A Frank-Wolfe type theorem for convex polynomial programs
EG Belousov et al.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2002)
分享论文
