On the Slater condition for the SDP relaxations of nonconvex sets (Q1604046): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q163017
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Tunçel, Levent / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularizing the abstract convex program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760093 / 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: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization. / 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: Restarting after branching in the SDP approach to MAX-CUT and similar combinatorial optimization 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: Strong Duality for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the graph partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating quadratic programming with bound and quadratic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the quadratic assignment problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0167-6377(01)00093-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089914558 / rank
 
Normal rank

Latest revision as of 11:10, 30 July 2024

scientific article
Language Label Description Also known as
English
On the Slater condition for the SDP relaxations of nonconvex sets
scientific article

    Statements

    On the Slater condition for the SDP relaxations of nonconvex sets (English)
    0 references
    3 July 2002
    0 references
    interior-point methods
    0 references
    dimension
    0 references
    affine hull
    0 references
    feasible solutions
    0 references
    combinatorial optimization
    0 references
    nonconvex optimization
    0 references
    semidefinite programming relaxations
    0 references
    0 references

    Identifiers

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