A semidefinite programming method for integer convex quadratic minimization (Q1749779): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1007/s11590-017-1132-y / rank
Normal rank
 
Property / cites work
 
Property / cites work: Closest point search in lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximate optima in lattices, codes, and systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Matrix Inequalities in System and Control Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective branch-and-bound algorithm for convex quadratic integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ellipsoid Bounds for Convex Quadratic Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations for non-convex quadratic mixed-integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: MLAMBDA: a modified LAMBDA method for integer least-squares estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating CVP to within almost-polynomial factors is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis / 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: Graph Implementations for Nonsmooth Convex Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice basis reduction: Improved practical algorithms and solving subset sum problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of sphere decoding in digital communications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4349924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring polynomials with rational coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4787205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Supersparse linear integer models for optimized medical scoring systems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S11590-017-1132-Y / rank
 
Normal rank

Latest revision as of 08:04, 11 December 2024

scientific article
Language Label Description Also known as
English
A semidefinite programming method for integer convex quadratic minimization
scientific article

    Statements

    A semidefinite programming method for integer convex quadratic minimization (English)
    0 references
    0 references
    0 references
    28 May 2018
    0 references
    convex optimization
    0 references
    integer quadratic programming
    0 references
    mixed integer programming
    0 references
    semidefinite relaxation
    0 references
    branch-and-bound
    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