Results 81 to 90 of about 33,726 (205)
Negativity‐preserving transforms of tuples of symmetric matrices
Proceedings of the London Mathematical Society, Volume 132, Issue 4, April 2026.Abstract Compared to the entrywise transforms which preserve positive semidefiniteness, those leaving invariant the inertia of symmetric matrices reveal a surprising rigidity. We first obtain the classification of negativity preservers by combining recent advances in matrix analysis with some novel arguments relying on well‐chosen test matrices, Sidon ...
Alexander Belton +3 more
wiley +1 more source
Applied Stochastic Models in Business and Industry, Volume 42, Issue 2, March/April 2026.ABSTRACT The so‐called algorithmic bias is a hot topic in the decision‐making process based on Artificial Intelligence, especially when demographics, such as gender, age or ethnic origin, come into play. Frequently, the problem is not only in the algorithm itself, but also in the biased data that feed the algorithm, which is just the reflection of the ...
Elena M. De‐Diego +2 more
wiley +1 more source
Semidefinite relaxation detector for higher-order modulated multiple-antenna systems
Tongxin xuebao, 2007 A semidefinite relaxation detector of 64-QAM signals was proposed,which is derived from rank relaxation and Lagrange bidual programming respectively.Computational complexity analyses and simulation results demonstrate the detector can make a good ...
YANG Yi-jin +3 more
doaj +2 more sources
Array pattern synthesis using semidefinite programming and a bisection method
ETRI Journal, 2019 In this paper, we propose an array pattern synthesis scheme using semidefinite programming (SDP) under array excitation power constraints. When an array pattern synthesis problem is formulated as an SDP problem, it is known that an additional rank‐one ...
Jong‐Ho Lee +3 more
doaj +1 more source
Exploiting Sparsity in SDP Relaxation for Harmonic Balance Method
IEEE Access, 2020 In general, harmonic balance problems are extremely nonconvex and difficult to solve. A convex relaxation in the form of semidefinite programming has attracted a lot of attention recently, as it finds a global solution with high accuracy without the need
Cheng-Hsiung Yang, Ben Shen Deng
doaj +1 more source
International Journal of Adaptive Control and Signal Processing, Volume 40, Issue 3, Page 544-564, March 2026.This paper proposes two projector‐based Hopfield neural network (HNN) estimators for online, constrained parameter estimation under time‐varying data, additive disturbances, and slowly drifting physical parameters. The first is a constraint‐aware HNN that enforces linear equalities and inequalities (via slack neurons) and continuously tracks the ...
Miguel Pedro Silva
wiley +1 more source
Approximate Graph Coloring by Semidefinite Programming [PDF]
, 1998 We consider the problem of coloring k-colorable graphs with the fewest possible colors. We present a randomized polynomial time algorithm that colors a 3-colorable graph on $n$ vertices with min O(Delta^{1/3} log^{1/2} Delta log n), O(n^{1/4} log^{1/2} n)
Karger, David +2 more
core +1 more source
Product Rules in Semidefinite Programming [PDF]
, 2007 In recent years we witness the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4] and even in complexity theory [7]. Examples to such bounds include the semidefinite relaxation for the maximal cut problem [5], and the quantum value of multi-prover interactive games [3,4].
Rajat Mittal 0001, Mario Szegedy
openaire +1 more source
International Journal of Mechanical System Dynamics, Volume 6, Issue 1, Page 140-152, March 2026.ABSTRACT Modern engineering systems require advanced uncertainty‐aware model updating methods that address parameter correlations beyond conventional interval analysis. This paper proposes a novel framework integrating Riemannian manifold theory with Gaussian Process Regression (GPR) for systems governed by Symmetric Positive‐Definite (SPD) matrix ...
Yanhe Tao +3 more
wiley +1 more source
Bounds for codes by semidefinite programming [PDF]
Proceedings of the Steklov Institute of Mathematics, 2008 Delsarte's method and its extensions allow to consider the upper bound problem for codes in 2-point-homogeneous spaces as a linear programming problem with perhaps infinitely many variables, which are the distance distribution. We show that using as variables power sums of distances this problem can be considered as a finite semidefinite programming ...
openaire +3 more sources