On Doubly Positive Semidefinite Programming Relaxations

DOI10.4208/jcm.1708-m2017-0130zbMath1413.90197OpenAlexW2801728121MaRDI QIDQ4688180

Yinyu Ye, Taoran Fu, Dong-Dong Ge

Publication date: 22 October 2018

Published in: Journal of Computational Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4208/jcm.1708-m2017-0130

zbMATH Keywords

semidefinite programmingrelaxationdoubly nonnegative matrixquartic optimization

Mathematics Subject Classification ID

Semidefinite programming (90C22) Quadratic programming (90C20)

Related Items

Conic relaxations for semi-supervised support vector machines, Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints, A new perspective on low-rank optimization, A matrix nonconvex relaxation approach to unconstrained binary polynomial programs, A robust Lagrangian-DNN method for a class of quadratic optimization problems, Burer's key assumption for semidefinite and doubly nonnegative relaxations, A proximal DC approach for quadratic assignment problem, A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems