SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 4 users not shown)
Property / cites work
 
Property / cites work: Problems of distance geometry and convex properties of quadratic maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3151174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of semidefinite programs via nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A projected gradient algorithm for solving the maxcut SDP relaxation / 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: Laplacian eigenvalues and the maximum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-Definite Matrix Constraints in Optimization / 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: SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotone globalization techniques for the Barzilai-Borwein gradient method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal correlation matrices / 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: Low-Rank Optimization on the Cone of Positive Semidefinite Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second order cone programming relaxation of nonconvex quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connection between semidefinite relaxations of the max-cut and stable set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4668573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An independent benchmarking of SDP and SOCP solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A NEW SECOND-ORDER CONE PROGRAMMING RELAXATION FOR MAX-CUT PROBLEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxation and nonconvex quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Rank of Extreme Matrices in Semidefinite Programs and the Multiplicity of Optimal Eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the max-cut problem using eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations / rank
 
Normal rank
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: Biq Mac / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: COL / 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-0593-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029471744 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q58002884 / rank
 
Normal rank

Latest revision as of 00:47, 6 July 2024

scientific article
Language Label Description Also known as
English
SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
scientific article

    Statements

    SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 December 2012
    0 references
    0 references
    low rank factorization
    0 references
    unconstrained binary quadratic programming
    0 references
    max-cut
    0 references
    nonlinear programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references