New semidefinite programming relaxations for box constrained quadratic program (Q365811): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C22 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C46 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6207048 / rank
 
Normal rank
Property / zbMATH Keywords
 
box constrained quadratic program
Property / zbMATH Keywords: box constrained quadratic program / rank
 
Normal rank
Property / zbMATH Keywords
 
Lagrangian dual
Property / zbMATH Keywords: Lagrangian dual / rank
 
Normal rank
Property / zbMATH Keywords
 
semidefinite programming
Property / zbMATH Keywords: semidefinite programming / rank
 
Normal rank
Property / zbMATH Keywords
 
D.C. optimization
Property / zbMATH Keywords: D.C. optimization / rank
 
Normal rank
Property / zbMATH Keywords
 
lower bound
Property / zbMATH Keywords: lower bound / rank
 
Normal rank
Property / zbMATH Keywords
 
zonotope
Property / zbMATH Keywords: zonotope / 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/s11425-012-4512-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000645105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial case of unconstrained zero-one quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse search for enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxation and nonconvex quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3772828 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions and optimality criteria to box constrained nonconvex minimization problems / 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: An improved lower bound and approximation algorithm for binary constrained quadratic programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the gap between the quadratic integer programming problem and its semidefinite relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5670441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On duality gap in binary quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved estimation of duality gap in binary quadratic programming using a weighted distance measure / rank
 
Normal rank
Property / cites work
 
Property / cites work: On The Reduction of Duality Gap in Box Constrained Nonconvex Quadratic Program / 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: Monotone projected gradient methods for large-scale box-constrained quadratic programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:17, 6 July 2024

scientific article
Language Label Description Also known as
English
New semidefinite programming relaxations for box constrained quadratic program
scientific article

    Statements

    New semidefinite programming relaxations for box constrained quadratic program (English)
    0 references
    0 references
    9 September 2013
    0 references
    box constrained quadratic program
    0 references
    Lagrangian dual
    0 references
    semidefinite programming
    0 references
    D.C. optimization
    0 references
    lower bound
    0 references
    zonotope
    0 references

    Identifiers