scientific article
From MaRDI portal
Publication:3497912
zbMath1151.15019MaRDI QIDQ3497912
Publication date: 28 May 2008
Full work available at URL: https://eudml.org/doc/129411
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Factorization of matrices (15A23) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items (24)
On the number of CP factorizations of a completely positive matrix ⋮ Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems ⋮ A factorization method for completely positive matrices ⋮ Completely positive factorization by a Riemannian smoothing method ⋮ Optimization under uncertainty and risk: quadratic and copositive approaches ⋮ Interiors of completely positive cones ⋮ Separating doubly nonnegative and completely positive matrices ⋮ Separation and relaxation for cones of quadratic forms ⋮ Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization ⋮ Copositive programming via semi-infinite optimization ⋮ Factorization and cutting planes for completely positive matrices by copositive projection ⋮ Nearly positive matrices ⋮ 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 ⋮ Extensions of the standard quadratic optimization problem: strong duality, optimality, hidden convexity and S-lemma ⋮ Completely positive matrices: real, rational, and integral ⋮ Quadratic factorization heuristics for copositive programming ⋮ A simplex algorithm for rational cp-factorization ⋮ Building a completely positive factorization ⋮ Copositive Programming ⋮ \(l_2\) Induced norm analysis of discrete-time LTI systems for nonnegative input signals and its application to stability analysis of recurrent neural networks ⋮ On the computation of \(C^*\) certificates ⋮ Sign patterns of inverse doubly nonnegative matrices and inverse completely positive matrices ⋮ A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
This page was built for publication:
