Publication:3497912

From MaRDI portal
Revision as of 23:38, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


zbMath1151.15019MaRDI QIDQ3497912

Mirjam Dür, Georg Still

Publication date: 28 May 2008

Full work available at URL: https://eudml.org/doc/129411


15A23: Factorization of matrices

15B48: Positive matrices and their generalizations; cones of matrices


Related Items

On the number of CP factorizations of a completely positive matrix, Completely positive factorization by a Riemannian smoothing method, Optimization under uncertainty and risk: quadratic and copositive approaches, A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems, Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization, The structure of completely positive matrices according to their CP-rank and CP-plus-rank, Analysis of copositive optimization based linear programming bounds on standard quadratic optimization, Quadratic factorization heuristics for copositive programming, Interiors of completely positive cones, On the computation of \(C^*\) certificates, Building a completely positive factorization, Separating doubly nonnegative and completely positive matrices, Separation and relaxation for cones of quadratic forms, Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma, Completely positive matrices: real, rational, and integral, A simplex algorithm for rational cp-factorization, \(l_2\) Induced norm analysis of discrete-time LTI systems for nonnegative input signals and its application to stability analysis of recurrent neural networks, Sign patterns of inverse doubly nonnegative matrices and inverse completely positive matrices, Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems, A factorization method for completely positive matrices, Copositive programming via semi-infinite optimization, Factorization and cutting planes for completely positive matrices by copositive projection, Nearly positive matrices, Copositive Programming