Results 101 to 110 of about 5,647,728 (213)
Semidefinite Programming (SDP) is a fairly recent way of solving optimization problems which are becoming more and more important in our fast moving world. It is a minimization of linear function over the intersection of the cone of positive semidefinite
Rasa Giniūnaitė
doaj +1 more source
On cone of nonsymmetric positive semidefinite matrices
A square real matrix is called a \(P_0\) (\(P\)) matrix if all its principal minors are nonnegative (positive). Let \(\mathcal P_0\) and \(\mathcal P\) denote the classes of \(P_0\) and \(P\) matrices, respectively. The authors study the cone of nonsymmetric positive semidefinite matrices (NS-psd cone).
Wang, Yingnan, Xiu, Naihua, Han, Jiye
openaire +1 more source
More information, less precision: Meta‐analysis through random effects
Abstract When several studies or other inputs estimate the same quantity, additional information need not increase precision once the inputs reveal heterogeneity that was not assumed in advance. We study this point in a Gaussian random‐effects model estimated by maximum likelihood.
Jan R. Magnus, Andrey L. Vasnev
wiley +1 more source
Data completion techniques offer numerous advantages in various fields. However, completing large datasets that must satisfy specific criteria can be challenging, necessitating the use of approximative completion methods.
Hajar A. Alshaikh +2 more
doaj +1 more source
Operational Choices for Risk Aggregation in Insurance: PSDization and SCR Sensitivity
This work addresses crucial questions about the robustness of the PSDization process for applications in insurance. PSDization refers to the process that forces a matrix to become positive semidefinite.
Xavier Milhaud +2 more
doaj +1 more source
Approximation by matrices positive semidefinite on a subspace
The authors study the following problem: Let \(A\in {\mathbb{R}}^{n\times n}\), \(S\in {\mathbb{R}}^{n\times p ...
Hayden, T.L., Wells, Jim
openaire +1 more source
Selector form of Weaver's conjecture and frame sparsification
Abstract We show an extension of a probabilistic result of Marcus, Spielman, and Srivastava, which resolved the Kadison–Singer problem, to block diagonal positive semidefinite random matrices. We use this result to show several selector results, which generalize their partition counterparts.
Marcin Bownik
wiley +1 more source
Using matrix analysis to understand competition in food webs and antimicrobial resistance networksUsing matrix analysis to understand competition in food webs and antimicrobial resistance networks [PDF]
Indirect competition is a fundamental mechanism shaping the structure of biological systems, from food webs to antimicrobial resistance (AMR) networks. Translating directed interaction data into a quantitative measure of competition remains a modelling ...
Hussein Al-Taani +3 more
doaj +1 more source
Non‐Central Wishart Random Matrices in Structural Dynamics: A Modal‐Basis Approach
ABSTRACT This article develops a non‐parametric stochastic computational model for linear structural dynamics based on a reduced non‐central Wishart (NCW) random matrix formulation. The objective is to represent uncertainty in the mass and stiffness matrices while preserving the matrix properties required for modal and frequency‐domain analysis ...
Alan Das Mannoosseril +2 more
wiley +1 more source
Some inequalities for unitarily invariant norms of matrices
This article aims to discuss inequalities involving unitarily invariant norms. We obtain a refinement of the inequality shown by Zhan. Meanwhile, we give an improvement of the inequality presented by Bhatia and Kittaneh for the Hilbert-Schmidt norm ...
Wang Shaoheng, Zou Limin, Jiang Youyi
doaj

