A Copositive Programming Approach to Graph Partitioning
From MaRDI portal
Publication:5444289
DOI10.1137/050637467zbMath1143.90025OpenAlexW2132687600MaRDI QIDQ5444289
Publication date: 25 February 2008
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c88a6df5916349b5d78553c37b9fc735e8648b7e
semidefinite programmingcopositive programmingbandwidth problemgraph partitioning problemvertex separator problem
Related Items
Copositive and semidefinite relaxations of the quadratic assignment problem, Matrix Relaxations in Combinatorial Optimization, Continuous quadratic programming formulations of optimization problems on graphs, On semidefinite programming bounds for graph bandwidth, On monotonicity and search strategies in face-based copositivity detection algorithms, On the copositive representation of binary and continuous nonconvex quadratic programs, LP-based tractable subcones of the semidefinite plus nonnegative cone, On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets, Moment approximations for set-semidefinite polynomials, Semidefinite approximations for quadratic programs over orthogonal matrices, Lower bounds for the bandwidth problem, A note on set-semidefinite relaxations of nonconvex quadratic programs, Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs, A new approximation hierarchy for polynomial conic optimization, A note on the SDP relaxation of the minimum cut problem, A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems, An exact penalty approach for optimization with nonnegative orthogonality constraints, Copositive optimization -- recent developments and applications, Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization, Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation, Exceptional family and solvability of copositive complementarity problems, Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017, Assignment Flows, The MIN-cut and vertex separator problem, Contribution of copositive formulations to the graph partitioning problem, Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems, Foundations of Set-Semidefinite Optimization, The CP-Matrix Approximation Problem, A proximal DC approach for quadratic assignment problem, Copositive Programming, SDP Relaxations for Some Combinatorial Optimization Problems, Algorithm 996, Depth-first simplicial partition for copositivity detection, with an application to MaxClique, Completely positive reformulations for polynomial optimization, Exploiting symmetry in copositive programs via semidefinite hierarchies, On Degenerate Doubly Nonnegative Projection Problems
Uses Software
