Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation (Q5364279): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(11 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1287/ijoc.2016.0731 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Couenne / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ConicBundle / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SBmethod / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SDPA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SeDuMi / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: EIQP IIQP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: BOB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2288470313 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1603.00347 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1287/IJOC.2016.0731 / rank
 
Normal rank

Latest revision as of 16:47, 30 December 2024

scientific article; zbMATH DE number 6785477
Language Label Description Also known as
English
Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation
scientific article; zbMATH DE number 6785477

    Statements

    Using a Conic Bundle Method to Accelerate Both Phases of a Quadratic Convex Reformulation (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 October 2017
    0 references
    semidefinite programming
    0 references
    Lagrangian duality
    0 references
    subgradient algorithm
    0 references
    bundle method
    0 references
    convex reformulation
    0 references
    quadratic 0-1 programming
    0 references
    \(k\)-cluster
    0 references
    densest subgraph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references