SDP relaxation method for detecting P-tensors
نویسندگان
چکیده
منابع مشابه
On Sensor Network Localization Using SDP Relaxation
Sensor network localization attempts to determine the locations of a group of sensors given the distances between some of them. The Semidefinite Programming (SDP) relaxation of this problem is widely used to determine the locations of the sensors [1]. In this paper, we analyze and determine a number of conditions that guarantee that the SDP relaxation is exact, i.e. gives the correct solution. ...
متن کاملAn Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs
We consider the general nonlinear optimization problem in 01 variables and provide an explicit equivalent convex positive semidefinite program in 2 − 1 variables. The optimal values of both problems are identical. From every optimal solution of the former one easily find an optimal solution of the latter and conversely, from every solution of the latter one may construct an optimal solution of ...
متن کاملExploiting Sparsity in SDP Relaxation for Sensor Network Localization
A sensor network localization problem can be formulated as a quadratic optimization problem (QOP). For quadratic optimization problems, semidefinite programming (SDP) relaxation by Lasserre with relaxation order 1 for general polynomial optimization problems (POPs) is known to be equivalent to the sparse SDP relaxation by Waki et al. with relaxation order 1, except the size and sparsity of the ...
متن کاملSDP Relaxation with Randomized Rounding for Energy Disaggregation
We develop a scalable, computationally efficient method for the task of energy disaggregation for home appliance monitoring. In this problem the goal is to estimate the energy consumption of each appliance over time based on the total energy-consumption signal of a household. The current state of the art is to model the problem as inference in factorial HMMs, and use quadratic programming to fi...
متن کاملHidden Integrality of SDP Relaxation for Sub-Gaussian Mixture Models
We consider the problem of estimating the discrete clustering structures under Sub-Gaussian Mixture Models. Our main results establish a hidden integrality property of a semidefinite programming (SDP) relaxation for this problem: while the optimal solutions to the SDP are not integer-valued in general, their estimation errors can be upper bounded in terms of the error of an idealized integer pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics, Optimization & Information Computing
سال: 2017
ISSN: 2310-5070,2311-004X
DOI: 10.19139/soic.v5i4.324