Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SDPLR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PENSDP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CSDP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QSDP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SDP_S / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SBmethod / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10107-012-0604-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2046706749 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedily Finding a Dense Subgraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSDP, A C library for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A preconditioned Newton algorithm for the nearest correlation matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering and domination in perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete p-dispersion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Lagrangian relaxation for general quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Maximization Problems Arising in Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dense \(k\)-subgraph problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some numerical experiments with variable-storage quasi-Newton algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved rounding method and semidefinite programming relaxation for graph partition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Construction Concerning (l p ) � ⊂l q / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior-Point Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the nearest correlation matrix--a problem from finance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum graph partitioning problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3983251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of large-scale SDP problems by the modified barrier method using iterative solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete location problems with push-pull objectives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dual Approach to Semidefinite Least-Squares Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The spherical constraint in Boolean quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Study of Semidefinite Bounds for the k-cluster Problem / rank
 
Normal rank
Property / cites work
 
Property / 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularization Methods for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Optimization of Monotonic Functions on Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds and exact algorithms for \(p\)-dispersion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Quadratically Convergent Newton Method for Computing the Nearest Correlation Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: From linear to semidefinite programming: an algorithm to obtain semidefinite relaxations for bivalent quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5442492 / rank
 
Normal rank

Latest revision as of 23:47, 5 July 2024

scientific article
Language Label Description Also known as
English
Solving \(k\)-cluster problems to optimality with semidefinite programming
scientific article

    Statements

    Solving \(k\)-cluster problems to optimality with semidefinite programming (English)
    0 references
    0 references
    0 references
    19 December 2012
    0 references
    \(k\)-cluster
    0 references
    exact resolution
    0 references
    Lagrangian relaxation
    0 references
    branch-and-bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers