Exact SDP relaxations for quadratic programs with bipartite graph structures.
Godai AzumaMituhiro FukudaSunyoung KimMakoto YamashitaPublished in: J. Glob. Optim. (2023)
Keyphrases
- graph structures
- semi definite programming
- quadratic program
- semidefinite
- linear programming
- graph structure
- convex relaxation
- semidefinite programming
- convex optimization
- linear program
- graph clustering
- structured data
- graph mining
- bipartite graph
- undirected graph
- directed graph
- graph model
- maximum margin
- lower bound
- kernel matrix
- linear constraints
- quadratic programming
- dynamic programming
- graphical models
- approximation algorithms
- objective function
- link prediction
- feasible solution
- convex sets
- mixed integer
- np hard