Results 211 to 220 of about 113,518 (248)

Learning linear PCA with convex semi-definite programming

Pattern Recognition, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Qing Tao, Gao-wei Wu, Jue Wang 0004
openaire   +1 more source

Mobile sensor mapping via semi-definite programming

2014 48th Asilomar Conference on Signals, Systems and Computers, 2014
We consider the problem of mapping the locations of a mobile device into the Euclidean space utilizing its perception of the environment through sensors, e.g., Wi-Fi. We formulate the estimation problem as a less-effort dynamic fringerprint technique, which capitalizes to non-convex optimization problem.
Giuseppe Destino, Davide Macagnano
openaire   +1 more source

Graph Partitioning and Semi-definite Programming Hierarchies

2012
Graph partitioning is a fundamental optimization problem that has been intensively studied. Many graph partitioning formulations are important as building blocks for divide-and-conquer algorithms on graphs as well as to many applications such as VLSI layout, packet routing in distributed networks, clustering and image segmentation.
openaire   +1 more source

The Analysis of Multivariate Data Using Semi-Definite Programming

Journal of Classification, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Failure Discrimination by Semi-Definite Programming

2002
This paper addresses itself to a new approach for failure discriminant analysis, a classical and yet very actively studied problem in financial engineering. The basic idea of the new method is to separate multi-dimensional financial data corresponding to ongoing and failed enterprises by an ellipsoidal surface which enjoys a good mathematical property ...
Hiroshi Konno, Jun-ya Gotoh, Stanislav Uryasev, Atsushi Yuki   +3 more
openaire   +1 more source

Robust controllability assessment via semi-definite programming

Systems & Control Letters, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Maryam Babazadeh, Amin Nobakhti
openaire   +2 more sources

Matrix Sum-of-Squares Relaxations for Robust Semi-Definite Programs

Mathematical Programming, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Carsten W. Scherer, Camile W. J. Hol
openaire   +1 more source

A semi-definite programming approach to source localization

The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003, 2004
A new algorithm based on semidefinite programming is presented for estimation of distributed source fields measured through a sensor array. The problem can be viewed as a subclass of inverse problems, which have been extensively investigated in the literature.
S. Penkatesh, W.C. Karl
openaire   +1 more source

Semi-definite optimization of the measured relative entropies of quantum states and channels

arXiv.org
The measured relative entropies of quantum states and channels find operational significance in quantum information theory as achievable error rates in hypothesis testing tasks. They are of interest in the near term, as they correspond to hybrid quantum--
Zixin Huang, Mark M. Wilde
semanticscholar   +1 more source

Using Semi-definite Programming to Enhance Supertree Resolvability

2005
Supertree methods are used to construct a large tree over a large set of taxa, from a set of small trees over overlapping subsets of the complete taxa set. Since accurate reconstruction methods are currently limited to a maximum of few dozens of taxa, the use of a supertree method in order to construct the tree of life is inevitable.
Shlomo Moran, Satish Rao, Sagi Snir
openaire   +1 more source