首頁 > 期刊 > 自然科學(xué)與工程技術(shù) > 基礎(chǔ)科學(xué) > 數(shù)學(xué) > 高等學(xué)校計算數(shù)學(xué)學(xué)報 > 關(guān)于二次約束二次規(guī)劃問題強對偶性的幾個結(jié)果 【正文】
摘要:In this paper, we revisit the strong duality of the quadratically constrained quadratic programming(QCQP) problem. We first generalize a known result for the rank-one decomposition of matrices and then apply it to consider the strong duality for more general QCQP scenarios, including the cases with one constraint, two constraints while at least one being inactive on the optimal solution point, multiple constraints, and an interval constraint. A sufficient condition ensuring the strong duality of more general QCQP problems is studied as well. We also extend our results to the QCQP problems with complex variables.
注:因版權(quán)方要求,不能公開全文,如需全文,請咨詢雜志社
主管單位:國家教育部;主辦單位:南京大學(xué)
一對一咨詢服務(wù)、簡單快捷、省時省力
了解更多 >直郵到家、實時跟蹤、更安全更省心
了解更多 >去除中間環(huán)節(jié)享受低價,物流進(jìn)度實時通知
了解更多 >正版雜志,匹配度高、性價比高、成功率高
了解更多 >