A modified simplex partition algorithm to test copositivity (Q2052385): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Evolution towards the maximum clique / 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: Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic copositivity detection by simplicial partition / 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: On the exhaustivity of simplicial partitioning / 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: An improved algorithm to test copositivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-first simplicial partition for copositivity detection, with an application to MaxClique / rank
 
Normal rank

Revision as of 07:32, 27 July 2024

scientific article
Language Label Description Also known as
English
A modified simplex partition algorithm to test copositivity
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references