Jordan symmetry reduction for conic optimization over the doubly nonnegative cone: theory and software
Sign Up to like & getrecommendations! Published in 2022 at "Optimization Methods and Software"
DOI: 10.1080/10556788.2021.2022146
Abstract: A common computational approach for polynomial optimization problems (POPs) is to use (hierarchies of) semidefinite programming (SDP) relaxations. When the variables in the POP are required to be nonnegative, these SDP problems typically involve nonnegative… read more here.
Keywords: doubly nonnegative; optimization; conic optimization; symmetry reduction ... See more keywords
Doubly Nonnegative and Semidefinite Relaxations for the Densest k-Subgraph Problem
Sign Up to like & getrecommendations! Published in 2019 at "Entropy"
DOI: 10.3390/e21020108
Abstract: The densest k-subgraph (DkS) maximization problem is to find a set of k vertices with maximum total weight of edges in the subgraph induced by this set. This problem is in general NP-hard. In this… read more here.
Keywords: relaxation; densest subgraph; doubly nonnegative; problem ... See more keywords