A fresh CP look at mixed-binary QPs: new formulations and relaxations (Q1683686): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(5 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10107-017-1109-8 / rank
Normal rank
 
Property / author
 
Property / author: Immanuel M. Bomze / rank
Normal rank
 
Property / author
 
Property / author: Immanuel M. Bomze / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2575524387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2928409 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones, matrices and mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive optimization -- recent developments and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On copositive programming and standard quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Burer's copositive representation of mixed-binary QPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Lower Bounds and Asymptotics for the cp-Rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the copositive representation of binary and continuous nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing a polyhedral-semidefinite relaxation of completely positive programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A gentle, geometric introduction to copositive optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity of membership problems for the completely positive cone and its dual / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Sparse Basis for the Null Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some NP-complete problems in quadratic and nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Closedness of the Linear Image of a Closed Convex Cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on the cp-rank and related properties of co(mpletely )positive matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3802887 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337625 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10107-017-1109-8 / rank
 
Normal rank

Latest revision as of 03:16, 11 December 2024

scientific article
Language Label Description Also known as
English
A fresh CP look at mixed-binary QPs: new formulations and relaxations
scientific article

    Statements

    A fresh CP look at mixed-binary QPs: new formulations and relaxations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 December 2017
    0 references
    copositivity
    0 references
    completely positive
    0 references
    conic optimization
    0 references
    quadratic optimization
    0 references
    reformulations
    0 references
    nonlinear optimization
    0 references
    nonconvex optimization
    0 references

    Identifiers