【创源大讲堂】SDP tightness for QCQPs with bipartite graph structure
时间:9月26日15:00-16:00地点:zoom会议号:82025536460;登录码:2023内容:Quadratically-constrainedquadraticprogramming(QCQP)isanoptimizationproblemthathasmanypracticalapplications,forexample,networklocalizationproblems,max-cutproblems,andpolynomialoptimizationproblems.SinceQCQPisNP-hard,semidefiniteprogramming(SDP)relaxationisoftenemployedtoobtainagoodapproximatesolution,andmanyresearchershaved...