A computational study on QP problems with general linear constraints (Q2673522): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods / 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: Global optimization problems and domain reduction strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical and computational results about optimality-based domain reductions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally solving nonconvex quadratic programming problems via completely positive programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: QPLIB: a library of quadratic programming instances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5183274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three enhancements for optimization-based bound tightening / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4697332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new branch-and-bound algorithm for standard quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems / 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: Maxima for Graphs and a New Proof of a Theorem of Turán / 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: Quadratic programming with one negative eigenvalue is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: BARON: A general purpose global optimization software package / 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: Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques / rank
 
Normal rank

Latest revision as of 07:29, 29 July 2024

scientific article
Language Label Description Also known as
English
A computational study on QP problems with general linear constraints
scientific article

    Statements

    A computational study on QP problems with general linear constraints (English)
    0 references
    0 references
    0 references
    0 references
    10 June 2022
    0 references
    quadratic programming
    0 references
    branch-and-bound
    0 references
    linear and convex relaxations
    0 references
    bound tightening
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers