Home > Papers

 
 
Research on a second-order cone reformulating problem of CDT problem
QU Yanming *
School of Science, Beijing University of Posts and Telecommunications, Beijing 100876.
*Correspondence author
#Submitted by
Subject:
Funding: none
Opened online:19 March 2019
Accepted by: none
Citation: QU Yanming.Research on a second-order cone reformulating problem of CDT problem[OL]. [19 March 2019] http://en.paper.edu.cn/en_releasepaper/content/4747715
 
 
In this paper, we study a class of CDT problem with two quadratic constraints, one of which is the unit ball constraint and the other is the ellipsoid constraint. Select the appropriate hyperplane through the optimal line segment, without dividing the feasible region. In the case of the second-order cone recombination technique and the SDP relaxation method, the necessary and sufficient conditions for the existence of the dual gap in the second-order cone reformulating problem of the CDT problem are obtained, and the theoretical proof is given which is paved to reduce or even eliminate the dual gap of the CDT problem.
Keywords:quadratically constrained quadratic programming; CDT problem; second-order cone; SDP relaxation
 
 
 

For this paper

  • PDF (0B)
  • ● Revision 0   
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags

Add yours

Related Papers

Statistics

PDF Downloaded 145
Bookmarked 0
Recommend 0
Comments Array
Submit your papers