An effective approach for DNN relaxation problems for mixed binary nonconvex quadratic optimization,

未来田中, Mirai Tanaka, 和秀中田, Kazuhide Nakata, 隼人脇, Hayato Waki

Published Feb 1, 2012• 0 citations

Related papers

Binary quadratic optimization problems that are difficult to solve by conic relaxations

Sunyoung Kim, Masakazu Kojima

A robust Lagrangian-DNN method for a class of quadratic optimization problems

Naohiko Arima, Sunyoung Kim, Masakazu Kojima +1 more

A matrix nonconvex relaxation approach to unconstrained binary polynomial programs

Yitian Qian, Shaohua Pan, Shujun Bi

Semidefinite Programming Based Convex Relaxation for Nonconvex Quadratically Constrained Quadratic Programming

Rujun Jiang, Duan Li

Semidefinite Relaxation for Two Mixed Binary Quadratically Constrained Quadratic Programs: Algorithms and Approximation Bounds

Zi Li Xu, Ming-Yi Hong

Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint

Xiaojin Zheng, Yutong Pan, Xueting Cui