New approximations for the cone of copositive matrices and its dual (Q2452380): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Q239244 / rank
Normal rank
 
Property / author
 
Property / author: Jean-Bernard Lasserre / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049904561 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1012.2552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable representations for convex hulls of low-dimensional quadratic forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive optimization -- recent developments and applications / 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: Solving standard quadratic optimization problems via linear, semidefinite and copositive pro\-gramming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Copositive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear programming reformulation of the standard quadratic optimization problem / 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: A Variational Approach to Copositive Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear inequalities and quadratic forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Invariant Integration Formulas for the <i>n</i>-Simplex by Combinatorial Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Look at Nonnegativity on Closed Sets and Polynomial Optimization / 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: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(K\)-moment problem for compact semi-algebraic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization of Polynomials Using Gradient Tentacles and Sums of Squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nullstellensatz and a Positivstellensatz in semialgebraic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the accuracy of uniform polyhedral approximations of the copositive cone / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:16, 8 July 2024

scientific article
Language Label Description Also known as
English
New approximations for the cone of copositive matrices and its dual
scientific article

    Statements

    New approximations for the cone of copositive matrices and its dual (English)
    0 references
    2 June 2014
    0 references
    The author provides convergent hierarchies for the convex cone \(\mathcal{C}\) of copositive matrices and its dual \(\mathcal{C}^*\), the cone of completely positive matrices. In both cases the corresponding hierarchy consists of nested spectrahedra and provide outer (resp. inner) approximations for \(\mathcal{C}\) (resp. for its dual \(\mathcal{C}^*\)), thus complementing previous inner (resp. outer) approximations for \(\mathcal{C}\) (for \(\mathcal{C}^*\)). In particular, both inner and outer approximations have a very simple interpretation. Finally, extension to \(\mathcal{K}\)-copositivity and \(\mathcal{K}\)-complete positivity for a closed convex cone \(\mathcal{K}\) is straightforward.
    0 references
    0 references
    copositive matrix
    0 references
    semidefinite relaxations
    0 references
    completely positive matrices
    0 references
    convex cone
    0 references
    0 references
    0 references