Semidefinite Programming for Approximate Maximum Likelihood Sinusoidal Parameter Estimation
We study the convex optimization approach for parameter estimation of several sinusoidal models, namely, single complex/real tone, multiple complex sinusoids, and single two-dimensional complex tone, in the presence of additive Gaussian noise.
Kenneth W. K. Lui, H. C. So
doaj +1 more source
A Reduced Semidefinite Programming Formulation for HA Assignment Problems in Sport Scheduling
Home-Away Assignment problems are naturally cast as quadraticpro gramming models in binary variables. In this work we compare alternative formulations for this kind of problems.
Hugo José Lara +2 more
doaj +1 more source
On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems [PDF]
AMS classification: 90C22, 20Cxx, 70-08traveling salesman problem;maximum bisection;semidefinite programming;association ...
Klerk, E. de, Pasechnik, D.V.
core +1 more source
Exploiting Group Symmetry in Truss Topology Optimization [PDF]
AMS classification: 90C22, 20Cxx, 70-08truss topology optimization;semidefinite programming;group ...
Bai, Y.Q. +3 more
core +1 more source
Semidefinite Programming and Constraint Programming [PDF]
Recently, semidefinite programming relaxations have been applied in constraint programming to take advantage of the high-quality bounds and precise heuristic guidance during the search for a solution. The purpose of this chapter is to present an overview of these developments, and to provide future research prospects.
openaire +1 more source
Product Theorems Via Semidefinite Programming
Typos corrected, some points ...
Lee, Troy, Mittal, Rajat
openaire +2 more sources
With the accelerating integration of distributed energy resources (DERs) into grids, enhanced bidirectional interactions between distribution and transmission systems have significantly complicated grid coordination.
Zhe Chen +5 more
doaj +1 more source
Matrix convex functions with applications to weighted centers for semidefinite programming [PDF]
In this paper, we develop various calculus rules for general smooth matrix-valued functions and for the class of matrix convex (or concave) functions first introduced by Loewner and Kraus in 1930s.
Brinkhuis, J., Luo, Z-Q., Zhang, S.
core +1 more source
Decomposition-Based Method for Sparse Semidefinite Relaxations of Polynomial Optimization Problems [PDF]
We consider polynomial optimization problems pervaded by a sparsity pattern. It has been shown in [1, 2] that the optimal solution of a polynomial programming problem with structured sparsity can be computed by solving a series of semidefinite ...
Berc Rustem +2 more
core
On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96) [PDF]
AMS classification: 90C22, 20Cxx, 70-08traveling salesman problem;semidefinite programming;quadratic as- signment ...
Klerk, E. de +2 more
core +1 more source

