Results 31 to 40 of about 9,824 (145)
Finding largest small polygons with GloptiPoly [PDF]
A small polygon is a convex polygon of unit diameter. We are interested in small polygons which have the largest area for a given number of vertices $n$. Many instances are already solved in the literature, namely for all odd $n$, and for $n=4, 6$ and 8.
C. Audet +17 more
core +6 more sources
An approach for optimising genetic contributions of candidates to control inbreeding in the offspring generation using semidefinite programming (SDP) was proposed.
Woolliams John A, Pong-Wong Ricardo
doaj +1 more source
Lower bounds on the size of semidefinite programming relaxations
We introduce a method for proving lower bounds on the efficacy of semidefinite programming (SDP) relaxations for combinatorial problems. In particular, we show that the cut, TSP, and stable set polytopes on $n$-vertex graphs are not the linear image of ...
Briët Jop +4 more
core +1 more source
In this article, we consider using time-of-arrival (TOA) measurements from a single moving receiver to locate a moving target at constant velocity that emits a periodic signal with unknown signal period.
Yanbin Zou, Jingna Fan, Zekai Zhang
doaj +1 more source
A Sum-of-Squares and Semidefinite Programming Approach for Maximum Likelihood DOA Estimation
Direction of arrival (DOA) estimation using a uniform linear array (ULA) is a classical problem in array signal processing. In this paper, we focus on DOA estimation based on the maximum likelihood (ML) criterion, transform the estimation problem into a ...
Shu Cai, Quan Zhou, Hongbo Zhu
doaj +1 more source
In low earth orbit (LEO) satellite communication systems, the limited energy supply capacity and the difficulty in obtaining channel state information (CSI) are the practical challenges.
Yang Liu +3 more
doaj +1 more source
Publication in the conference proceedings of EUSIPCO, Viena, Austria ...
Chen, Hai Hua, Ho, K.L.
openaire +1 more source
A semidefinite program for unbalanced multisection in the stochastic block model
We propose a semidefinite programming (SDP) algorithm for community detection in the stochastic block model, a popular model for networks with latent community structure.
Perry, Amelia, Wein, Alexander S.
core +1 more source
Efficient Semidefinite Spectral Clustering via Lagrange Duality [PDF]
We propose an efficient approach to semidefinite spectral clustering (SSC), which addresses the Frobenius normalization with the positive semidefinite (p.s.d.) constraint for spectral clustering.
Chunhua Shen +3 more
core +1 more source
Prestress Design of Tensegrity Structures Using Semidefinite Programming
Finding appropriate prestresses which can stabilize the system is a key step in the design of tensegrity structures. A semidefinite programming- (SDP-) based approach is developed in this paper to determine appropriate prestresses for tensegrity ...
Yafeng Wang, Xian Xu
doaj +1 more source

