On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems

By Engau Alexander   Anjos Miguel F.   Vannelli Anthony  

Optimization Methods and Software, Vol. 27, Iss. 3, 2012-06 ,pp. : 539-559

Taylor & Francis Ltd

Access to resources Recommend Favorite

Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization

By Waki Hayato  

Computational Optimization and Applications, Vol. 53, Iss. 3, 2012-12 ,pp. : 823-844

Springer Publishing Company

Access to resources Recommend Favorite

Solving semidefinite programs using preconditioned conjugate gradients

By Wolkowicz Henry  

Optimization Methods and Software, Vol. 19, Iss. 6, 2004-12 ,pp. : 653-672

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Tight Semidefinite Relaxation of the MAX CUT Problem

By Liu Hongwei   Liu Sanyang   Xu Fengmin  

Journal of Combinatorial Optimization, Vol. 7, Iss. 3, 2003-09 ,pp. : 237-245

Springer Publishing Company

Access to resources Recommend Favorite

A note on semidefinite relaxation for 0-1 quadratic knapsack problems

By Zheng Xiaojin  

Optimization Methods and Software, Vol. 28, Iss. 4, 2013-08 ,pp. : 930-942

Taylor & Francis Ltd

Access to resources Recommend Favorite