Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures

Sunyoung Kim (), Masakazu Kojima () and Kim-Chuan Toh ()
Additional contact information
Sunyoung Kim: Ewha W. University
Masakazu Kojima: Chuo University
Kim-Chuan Toh: National University of Singapore

Journal of Global Optimization, 2020, vol. 77, issue 3, No 4, 513-541

Abstract: Abstract We study the equivalence among a nonconvex QOP, its CPP and DNN relaxations under the assumption that the aggregate and correlative sparsity of the data matrices of the CPP relaxation is represented by a block-clique graph G. By exploiting the correlative sparsity, we decompose the CPP relaxation problem into a clique-tree structured family of smaller subproblems. Each subproblem is associated with a node of a clique tree of G. The optimal value can be obtained by applying an algorithm that we propose for solving the subproblems recursively from leaf nodes to the root node of the clique-tree. We establish the equivalence between the QOP and its DNN relaxation from the equivalence between the reduced family of subproblems and their DNN relaxations by applying the known results on: (1) CPP and DNN reformulation of a class of QOPs with linear equality, complementarity and binary constraints in 3 nonnegative variables. (2) DNN reformulation of a class of quadratically constrained convex QOPs with any size. (3) DNN reformulation of LPs with any size. As a result, we show that a QOP whose subproblems are the QOPs mentioned in (1), (2) and (3) is equivalent to its DNN relaxation, if the subproblems form a clique-tree structured family induced from a block-clique graph.

Keywords: Equivalence of doubly nonnegative relaxations and completely positive programs; Sparsity of completely positive reformulations; Aggregate and correlative sparsity; Block-clique graphs; Completely positive and doubly nonnegative matrix completion; Exact optimal values of nonconvex QOPs; 90C20; 90C26 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10898-020-00879-y Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:77:y:2020:i:3:d:10.1007_s10898-020-00879-y

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-020-00879-y

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().