On the Slater condition for the SDP relaxations of nonconvex sets
暂无分享,去创建一个
[1] Franz Rendl,et al. Semidefinite Programming Relaxations for the Quadratic Assignment Problem , 1998, J. Comb. Optim..
[2] Qing Zhao,et al. Semidefinite Programming Relaxations for the Graph Partitioning Problem , 1999, Discret. Appl. Math..
[3] John E. Mitchell. Restarting after Branching in the SDP Approach to MAX-CUT and Similar Combinatorial Optimization Problems , 2001, J. Comb. Optim..
[4] Masakazu Kojima,et al. Semidefinite Programming Relaxation for Nonconvex Quadratic Programs , 1997, J. Glob. Optim..
[5] Masakazu Kojima,et al. Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets , 1999, SIAM J. Optim..
[6] Yinyu Ye,et al. Approximating quadratic programming with bound and quadratic constraints , 1999, Math. Program..
[7] J. Borwein,et al. Regularizing the Abstract Convex Program , 1981 .
[8] Y. Ye,et al. Approximating Maximum Stable Set and Minimum Graph Coloring Problems with the Positive Semidefinite Relaxation , 2001 .
[9] Alexander Schrijver,et al. Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..
[10] Masakazu Kojima,et al. Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization , 2000, Math. Program..
[11] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.
[12] Henry Wolkowicz,et al. Strong Duality for Semidefinite Programming , 1997, SIAM J. Optim..
[13] Y. Nesterov. Semidefinite relaxation and nonconvex quadratic optimization , 1998 .