Solving \(k\)-cluster problems to optimality with semidefinite programming
type: Item
instance of: scholarly article
title: Solving \(k\)-cluster problems to optimality with semidefinite programming
zbMATH Open document ID: 1257.90068
author: Jérôme Malick
author: Frédéric Roupin
published in: Mathematical Programming. Series A. Series B
publication date: 2012-12-19T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6116942
zbMATH Keywords: \(k\)-cluster
zbMATH Keywords: exact resolution
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: branch-and-bound
describes a project that uses: SDPLR
describes a project that uses: PENSDP
describes a project that uses: CSDP
describes a project that uses: QSDP
describes a project that uses: SDP_S
describes a project that uses: SBmethod
MaRDI profile type: Publication
full work available at URL: s10107-012-0604-1
OpenAlex ID: W2046706749
cites work: Greedily Finding a Dense Subgraph
cites work: Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
cites work: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
cites work: CSDP, A C library for semidefinite programming
cites work: A preconditioned Newton algorithm for the nearest correlation matrix
cites work: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
cites work: Clustering and domination in perfect graphs
cites work: The discrete p-dispersion problem
cites work: Algorithms – ESA 2005
cites work: Partial Lagrangian relaxation for general quadratic programming
cites work: Approximation algorithms for maximization problems arising in graph partitioning
cites work: The dense \(k\)-subgraph problem
cites work: Some numerical experiments with variable-storage quasi-Newton algorithms
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: An improved rounding method and semidefinite programming relaxation for graph partition
cites work: A Construction Concerning (l p ) � ⊂l q
cites work: A Spectral Bundle Method for Semidefinite Programming
cites work: An Interior-Point Method for Semidefinite Programming
cites work: Computing the nearest correlation matrix--a problem from finance
cites work: Improved approximation algorithms for maximum graph partitioning problems
cites work: Q3983251
cites work: Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
cites work: On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
cites work: Discrete location problems with push-pull objectives
cites work: A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs
cites work: On the Shannon capacity of a graph
cites work: A Dual Approach to Semidefinite Least-Squares Problems
cites work: The spherical constraint in Boolean quadratic programs
cites work: Numerical study of semidefinite bounds for the \(k\)-cluster problem
cites work: On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods
cites work: Regularization Methods for Semidefinite Programming
cites work: Branching rules revisited
cites work: Numerical Optimization
cites work: Efficient Optimization of Monotonic Functions on Trees
cites work: Upper bounds and exact algorithms for \(p\)-dispersion problems
cites work: A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix
cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
cites work: From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems
cites work: Semidefinite optimization
cites work: Q5442492
DOI: 10.1007/S10107-012-0604-1
description: scientific article; zbMATH DE number 6116942