Results 181 to 190 of about 6,028,400 (221)

Gibbs manifolds. [PDF]

Inf Geom
Pavlov D, Sturmfels B, Telen S.
europepmc   +1 more source

Operationally classical simulation of quantum states. [PDF]

Nat Commun
Cobucci G, Bernal A, Renner MJ, Tavakoli A.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Semidefinite Programming

SIAM Review, 1996
In semidefinite programming, one minimizes a linear function subject to the constraint that an affine combination of symmetric matrices is positive semidefinite. Such a constraint is nonlinear and nonsmooth, but convex, so semidefinite programs are convex optimization problems. Semidefinite programming unifies several standard problems (e.g.
Vandenberghe, Lieven, Boyd, Stephen
semanticscholar   +3 more sources

Semidefinite programming

European Journal of Operational Research, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christoph Helmberg
openaire   +3 more sources

Semidefinite programming

Computer Vision, 2014
Chunhua Shen, Anton van den Hengel
semanticscholar   +3 more sources

Semidefinite programming relaxations for quantum correlations

, 2023
Semidefinite programs are convex optimisation problems involving a linear objective function and a domain of positive semidefinite matrices. Over the last two decades, they have become an indispensable tool in quantum information science.
A. Tavakoli, Alejandro Pozas-Kerstjens, Peter J. Brown, M. Ara'ujo   +3 more
semanticscholar   +1 more source

T-positive semidefiniteness of third-order symmetric tensors and T-semidefinite programming

Computational optimization and applications, 2020
The T-product for third-order tensors has been used extensively in the literature. In this paper, we first introduce first-order and second-order T-derivatives for the multi-variable real-valued function with the tensor T-product.
Meng-Meng Zheng, Zhenghai Huang, Yong Wang   +2 more
semanticscholar   +1 more source

Semidefinite Programming for Unified TDOA-Based Localization Under Unknown Propagation Speed

IEEE Communications Letters, 2020
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 far-field TDOA-based localization.
Hengnian Qi, Xiaoping Wu, Liangquan Jia
semanticscholar   +1 more source

Cooperative RSS-Based Localization in Wireless Sensor Networks Using Relative Error Estimation and Semidefinite Programming

IEEE Transactions on Vehicular Technology, 2019
A new cooperative received signal strength-based localization algorithm is proposed which employs relative error estimation and semidefinite programming (SDP).
Zengfeng Wang, Hao Zhang, Tingting Lu, T. Gulliver   +3 more
semanticscholar   +1 more source