Relaxing the optimality conditions of box QP (Q538311): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10589-009-9273-2 / 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: YALMIP / 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/s10589-009-9273-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1980605677 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization algorithms for linearly constrained indefinite quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic programming with one negative eigenvalue is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802887 / 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: A polyhedral study of nonconvex quadratic programs with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating quadratic programming with bound and quadratic constraints / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10589-009-9273-2 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:51, 9 December 2024

scientific article
Language Label Description Also known as
English
Relaxing the optimality conditions of box QP
scientific article

    Statements

    Relaxing the optimality conditions of box QP (English)
    0 references
    0 references
    0 references
    25 May 2011
    0 references
    semidefinite relaxations
    0 references
    basic semidefinite relaxation due to Shor
    0 references
    branch-and-bound
    0 references
    0 references
    0 references

    Identifiers