Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting (Q2307758): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: SDPT3 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Matlab / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Sostools / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Biq Mac / 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/s10898-019-00813-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2964435736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended Matrix Cube Theorems with Applications to μ-Theory in Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the copositive representation of binary and continuous nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representing quadratically constrained quadratic programs as generalized copositive programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets'' / 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: On the irreducibility, self-duality an non-homogeneity of completely positive cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxations of vertex packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: GloptiPoly 3: moments, optimization and semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complex Matrix Decomposition and Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter Linear and Semidefinite Relaxations for Max-Cut Based on the Lovász--Schrijver Lift-and-Project Procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxation and nonconvex quadratic optimization / 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: Transmit beamforming for physical-layer multicasting / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximating complex quadratic optimization problems via semidefinite programming relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of purely complex μ computation and related problems in multidimensional systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Latest Developments in the SDPA Family for Solving Large-Scale SDPs / rank
 
Normal rank

Latest revision as of 02:57, 22 July 2024

scientific article
Language Label Description Also known as
English
Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
scientific article

    Statements

    Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 March 2020
    0 references
    max-cut problem
    0 references
    complex variables
    0 references
    semidefinite relaxation
    0 references
    unit modulus lifting
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers