Results 111 to 120 of about 2,874 (210)

Semidefinite Programming Approaches to Hankel Matrix Approximation and Completion via Primal–Dual Interior-Point Methods

Journal of Mathematics
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, Mohammed M. Alshahrani, Suliman S. Al-Homidan   +2 more
doaj   +1 more source

Operational Choices for Risk Aggregation in Insurance: PSDization and SCR Sensitivity

Risks, 2018
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, Victorien Poncelet, Clement Saillard   +2 more
doaj   +1 more source

Weighted Algebraic Connectivity Maximization for Optical Satellite Networks

IEEE Access, 2017
In this paper, the topology configuration methods for heterogeneous optical satellite networks are investigated. Our objectives are to maximize weighted algebraic connectivity with respect to both network initialization and reconfiguration scenarios ...
Yongxing Zheng, Shanghong Zhao, Yun Liu, Yongjun Li, Qinggui Tan, Ning Xin   +5 more
doaj   +1 more source

Minimal condition number for positive definite Hankel matrices using semidefinite programming [PDF]

, 2010
We present a semidefinite programming approach for computing optimally conditioned positive definite Hankel matrices of order n. Unlike previous approaches, our method is guaranteed to find an optimally conditioned positive definite Hankel matrix within ...
Potra, Florian A., Alshahrani, Mohammad M., Petra, Cosmin G., Al-Homidan, Suliman, Suliman Al-Homidan, Mohammad M. Alshahrani, Florian A. Potra, Cosmin G. Petra   +7 more
core   +1 more source

Some inequalities for unitarily invariant norms of matrices

Journal of Inequalities and Applications, 2011
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  

A Generalized HSS Iteration Method for Continuous Sylvester Equations

Journal of Applied Mathematics, 2014
Based on the Hermitian and skew-Hermitian splitting (HSS) iteration technique, we establish a generalized HSS (GHSS) iteration method for solving large sparse continuous Sylvester equations with non-Hermitian and positive definite/semidefinite matrices ...
Xu Li, Yu-Jiang Wu, Ai-Li Yang, Jin-Yun Yuan   +3 more
doaj   +1 more source

On classes of matrices containing M-matrices and hermitian positive semidefinite matrices

Linear Algebra and its Applications, 1984
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Singular value inequalities for matrices related to convex and concave functions

Journal of Inequalities and Applications
In this note, we give several singular value inequalities involving convex and concave functions, which can be considered as generalizations of Al-Natoor et al.’s results (J. Math. Inequal. 17:581–589, 2023).
Shengyan Ma, Lihong Hu, Xiaohui Fu
doaj   +1 more source

Enhanced Young-type inequalities utilizing Kantorovich approach for semidefinite matrices

Open Mathematics
This article introduces new Young-type inequalities, leveraging the Kantorovich constant, by refining the original inequality. In addition, we present a range of norm-based inequalities applicable to positive semidefinite matrices, such as the Hilbert ...
Bani-Ahmad Feras, Rashid Mohammad Hussein Mohammad   +1 more
doaj   +1 more source

Hanner's Inequality For Positive Semidefinite Matrices

, 2021
Error in Theorem 3.1 requires significant ...
openaire   +2 more sources