SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs (Q2097634): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3181879400 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2106.13721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LAPACK Users' Guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient compact quadratic convex reformulation for general integer quadratic programs / 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: Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Lagrangian relaxation for general quadratic programming / 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 hybrid LP/NLP paradigm for global optimization relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems and the Location of Economic Activities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting integrality in the global optimization of mixed-integer nonlinear programming problems with BARON / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global minimization of indefinite quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic assignment formulation of the molecular conformation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of nonconvex factorable programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex extensions and envelopes of lower semi-continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833805 / rank
 
Normal rank

Latest revision as of 20:27, 30 July 2024

scientific article
Language Label Description Also known as
English
SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs
scientific article

    Statements

    SDP-quality bounds via convex quadratic relaxations for global optimization of mixed-integer quadratic programs (English)
    0 references
    0 references
    0 references
    0 references
    14 November 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    global optimization
    0 references
    mixed integer quadratic programs
    0 references
    semidefinite programming relaxations
    0 references
    convex quadratic relaxations
    0 references
    quadratic cuts
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references