3 citations · 3 across the 3 of their papers we have counts for
Showing math.OCShow all
3 papers · 1 filter
math.OC2012
The equivalence between doubly nonnegative relaxation and semidefinite relaxation for binary quadratic programming problems
Chuan-Hao Guo, Yan-Qin Bai, Li-Ping Tang
It has recently been shown (Burer, Math. Program Ser. A 120:479-495, 2009) that a large class of NP-hard nonconvex quadratic programming problems can be modeled as so called comple…
math.OC2012★ 3 cited
Doubly nonnegative relaxation method for solving multiple objective quadratic programming problems
Yan-Qin Bai, Chuan-Hao Guo
Multicriterion optimization and Pareto optimality are fundamental tools in economics. In this paper we propose a new relaxation method for solving multiple objective quadratic prog…
math.OC2012
A New Superlinearly Convergent Algorithm of Combining QP Subproblem with System of Linear Equations for Nonlinear Optimization
Jin-Bao Jian, Chuan-Hao Guo, Chun-Ming Tang +1
In this paper, a class of optimization problems with nonlinear inequality constraints is discussed. Based on the ideas of sequential quadratic programming algorithm and the method…