Results 1 to 10 of about 40,316 (199)
, 2012 We consider a short rate model, driven by a stochastic process on the cone of positive semidefinite matrices.
ALESSANDRO GNOATTO +4 more
core +1 more source
Phase retrieval using random cubatures and fusion frames of positive semidefinite matrices [PDF]
, 2016 As a generalization of the standard phase retrieval problem,we seek to reconstruct symmetric rank- 1 matrices from inner products with subclasses of positive semidefinite matrices.
Ehler, M, Graef, M, Kiraly, FJ
core +1 more source
A Parallel Approximation Algorithm for Positive Semidefinite Programming
, 2011 Positive semidefinite programs are an important subclass of semidefinite programs in which all matrices involved in the specification of the problem are positive semidefinite and all scalars involved are non-negative.
Jain, Rahul, Yao, Penghui
core +1 more source
Generalized Randić Estrada Indices of Graphs
Mathematics, 2022 Let G be a simple undirected graph on n vertices. V. Nikiforov studied hybrids of AG and DG and defined the matrix AαG for every real α∈[0,1] as AαG=αDG+(1−α)AG.
Eber Lenes +3 more
doaj +1 more source
Adaptation of Symmetric Positive Semi-Definite Matrices for the Analysis of Textured Images
Cybernetics and Information Technologies, 2018 This paper addresses the analysis of textured images using the symmetric positive semi-definite matrix. In particular, a field of symmetric positive semi-definite matrices is used to estimate the structural information represented by the local ...
Akl Adib
doaj +1 more source
Regression on fixed-rank positive semidefinite matrices: a Riemannian approach [PDF]
, 2011 The paper addresses the problem of learning a regression model parameterized by a fixed-rank positive semidefinite matrix. The focus is on the nonlinear nature of the search space and on scalability to high-dimensional problems.
Bonnabel, Silvere +2 more
core
, 2016 Completely positive (CP) tensors, which correspond to a generalization of CP matrices, allow to reformulate or approximate a general polynomial optimization problem (POP) with a conic optimization problem over the cone of CP tensors.
Kuang, Xiaolong, Zuluaga, Luis F.
core +1 more source
Bounds of the logarithmic mean [PDF]
, 2013 We give tight bounds for logarithmic mean. We also give new Frobenius norm inequalities for two positive semidefinite matrices. In addition, we give some matrix inequalities on matrix power mean.Comment: The second assertion in (i) of Proposition 5.2 was
Furuichi, Shigeru, Yanagi, Kenjiro
core +2 more sources
Preserving positivity for rank-constrained matrices
, 2017 Entrywise functions preserving the cone of positive semidefinite matrices have been studied by many authors, most notably by Schoenberg [Duke Math. J. 9, 1942] and Rudin [Duke Math. J. 26, 1959].
Guillot, Dominique +2 more
core +1 more source
Journal of Inequalities and Applications, 2018 Recently, Kittaneh and Manasrah (J. Math. Anal. Appl. 361:262–269, 2010) showed a refinement of the arithmetic–geometric mean inequality for the Frobenius norm. In this paper, we shall present a generalization of Kittaneh and Manasrah’s result. Meanwhile,
Xuesha Wu
doaj +1 more source