A projected gradient algorithm for solving the maxcut SDP relaxation (Q2770188): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
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: 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.1080/10556780108805818 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000602248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph-theoretic via minimization algorithm for two-layer printed circuit boards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxation for nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4703906 / 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: 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: Solving Graph Bisection Problems with Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An incomplete Cholesky factorization for dense symmetric positive definite matrices / 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: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxation and nonconvex quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:41, 3 June 2024

scientific article
Language Label Description Also known as
English
A projected gradient algorithm for solving the maxcut SDP relaxation
scientific article

    Statements

    A projected gradient algorithm for solving the maxcut SDP relaxation (English)
    0 references
    0 references
    0 references
    2001
    0 references
    0 references
    0 references
    0 references
    0 references
    Semidefinite programming
    0 references
    Maxcut
    0 references
    Approximation algorithm
    0 references
    Semidefinite relaxation
    0 references
    Projected gradient method
    0 references
    0 references
    0 references
    0 references