Interiors of completely positive cones (Q897047): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The \(\mathcal A\)-truncated \(K\)-moment problem / 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: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming / 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: Copositive optimization -- recent developments and applications / 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: Q3047212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5490302 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of the Stability Number of a Graph via Copositive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Complete Positivity Detection and Decomposition of Sparse Matrices / 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: An improved characterisation of the interior of the completely positive cone / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3497912 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The truncated moment problem via homogenization and flat extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5592263 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semidefinite approach for truncated \(K\)-moment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting Global Optimality and Extracting Solutions in GloptiPoly / rank
 
Normal rank
Property / cites work
 
Property / cites work: GloptiPoly 3: moments, optimization and semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximations for the cone of copositive matrices and its dual / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimality conditions and finite convergence of Lasserre's hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Stability Number of a Graph Via Linear and Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cp-Rank and Minimal cp Factorizations of a Completely Positive Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization and cutting planes for completely positive matrices by copositive projection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: The CP-Matrix Completion Problem / rank
 
Normal rank

Latest revision as of 04:43, 11 July 2024

scientific article
Language Label Description Also known as
English
Interiors of completely positive cones
scientific article

    Statements

    Interiors of completely positive cones (English)
    0 references
    16 December 2015
    0 references
    The authors characterize the interior of a completely positive cone. They propose a semidefinite algorithm for checking whether a matrix is in the interior of a completey positive cone. Some computational experiments are presented.
    0 references
    completely positive cone
    0 references
    linear optimization with moments
    0 references
    numerical examples
    0 references
    semidefinite algorithm
    0 references
    0 references
    0 references
    0 references
    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
    0 references