Results 71 to 80 of about 6,028,400 (221)
Online Local Learning via Semidefinite Programming
, 2014 In many online learning problems we are interested in predicting local information about some universe of items. For example, we may want to know whether two items are in the same cluster rather than computing an assignment of items to clusters; we may ...
Blum A., Hazan E., Kulis Brian, Niu Gang
core +1 more source
Quantum Coding via Semidefinite Programming
2019 IEEE International Symposium on Information Theory (ISIT), 2019 We derive converging hierarchies of efficiently computable semidefinite programming outer bounds on the optimal fidelity for the transmission of quantum information over noisy quantum channels. Based on positive partial transpose conditions we give a sufficient criterion for the exact convergence at any given level of the hierarchies.
Berta, M +3 more
openaire +2 more sources
Finite Quantum Tomography and Semidefinite Programming [PDF]
International Journal of Theoretical Physics, 2006 25 ...
Mirzaee, M. +2 more
openaire +2 more sources
CAAI Transactions on Intelligence Technology, EarlyView.Abstract In a multi‐row facility layout problem (MRFLP), facilities are arranged in more than one row under the limited layout area. Considering different layout factors, various extensions of MRFLP have been modelled. However, the orientation of input/output (I/O) point in a facility, as a key factor that plays a direct impact on flow cost, is seldom ...
Yinan Guo +5 more
wiley +1 more source
A Method for Semidefinite Quasiconvex Maximization Problem
Известия Иркутского государственного университета: Серия "Математика", 2016 We introduce so-called semidefinite quasiconvex maximization problem. We derive new global optimality conditions by generalizing [9]. Using these conditions, we construct an algorithm which generates a sequence of local maximizers that converges to a ...
R. Enkhbat +3 more
doaj
On the Solution of a Nonlinear Semidefinite Program Arising in Discrete-Time Feedback Control Design
Journal of Applied Mathematics, 2014 A sequential quadratic programming method with line search is analyzed and studied for finding the local solution of a nonlinear semidefinite programming problem resulting from the discrete-time output feedback problem.
El-Sayed M. E. Mostafa
doaj +1 more source
SDP Relaxation Methods for RSS/AOA-Based Localization in Sensor Networks
IEEE Access, 2020 With the fast development of new array technology and intelligent antenna, it is easier to obtain angle of arrival (AOA) measurements. Hybrid received signal strength (RSS) and AOA measurement techniques are proposed for the position computing in sensor ...
Hengnian Qi, Lufeng Mo, Xiaoping Wu
doaj +1 more source
Cubical coloring — fractional covering by cuts and semidefinite programming [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 We introduce a new graph parameter that measures fractional covering of a graph by cuts. Besides being interesting in its own right, it is useful for study of homomorphisms and tension-continuous mappings.
Robert Šámal
doaj +1 more source
Improved semidefinite programming upper bound on distillable entanglement [PDF]
, 2016 A new additive and semidefinite programming (SDP) computable entanglement measure is introduced to upper bound the amount of distillable entanglement in bipartite quantum states by operations completely preserving the positivity of partial transpose (PPT)
Xin Wang, R. Duan
semanticscholar +1 more source
IET Smart Energy Systems, EarlyView.An adaptive chance‐constrained hybrid SOCP‐Based ACOPF for coordinated optimisation of integrated source–grid–load–storage systems is presented. The coordinated optimisation of integrated source–grid–load–storage (SGLS) systems is challenged by renewable energy uncertainty, complex industrial load characteristics and stringent policy constraints ...
Mingyue He +6 more
wiley +1 more source