Abstract: We propose a novel approach to the source localization and tracking problem in wireless sensor networks. By applying minimax approximation and semidefinite relaxation, we transform the ...

1 Computer Science Department, University Dr Moulay Tahar of Saida, Saida, Algeria. 2 Computer Science Department, University Djillali Liabes of SidiBel Abbes, SidiBel Abbes, Algeria. Before going ...

Semidefinite programming (SDP) is a subfield of convex optimization concerned with the optimization of a linear objective function (a user-specified function that the user wants to minimize or ...

Abstract: By assuming signal propagation speed to be unknown, a convex rank unconstrained semidefinite programming (RUSDP) algorithm is designed to obtain the unified solution for near-field and ...

Semidefinite programming (SDP) is a subfield of convex optimization concerned with the optimization of a linear objective function (a user-specified function that the user wants to minimize or ...

A hierarchy of semidefinite programming (SDP) relaxations approximates the global optimum of polynomial optimization problems of noncommuting variables. Generating the relaxation, however, is a ...

ABSTRACT: This paper considers the NP (Non-deterministic Polynomial)-hard problem of finding a minimum value of a quadratic program (QP), subject to m non-convex inhomogeneous quadratic constraints.

Quantum steering refers to the non-classical correlations that can be observed between the outcomes of measurements applied on half of an entangled state and the resulting post-measured states that ...