Results 1 to 10 of about 550 (54)
Semidefinite bounds for nonbinary codes based on quadruples. [PDF]
Des Codes Cryptogr, 2017 For nonnegative integers $q,n,d$, let $A_q(n,d)$ denote the maximum cardinality of a code of length $n$ over an alphabet $[q]$ with $q$ letters and with minimum distance at least $d$. We consider the following upper bound on $A_q(n,d)$. For any $k$, let $
Litjens B, Polak S, Schrijver A.
europepmc +7 more sources
Logarithmic Barrier Method Via Minorant Function for Linear Semidefinite Programming
Annales Mathematicae Silesianae, 2023 We propose in this study, a new logarithmic barrier approach to solve linear semidefinite programming problem. We are interested in computation of the direction by Newton’s method and of the displacement step using minorant functions instead of line ...
Leulmi Assma
doaj +1 more source
EURO Journal on Computational Optimization, 2021 A conic optimization problem is a problem involving a constraint that the optimization variable be in some closed convex cone. Prominent examples are linear programs (LP), second order cone programs (SOCP), semidefinite problems (SDP), and copositive ...
Mirjam Dür, Franz Rendl
doaj +1 more source
Reproducibility of serum testing for environmental allergen‐specific IgE in dogs in Europe
Veterinary Dermatology, Volume 32, Issue 3, Page 251-e67, June 2021., 2021 Background – Serum testing for allergen‐specific immunoglobulin (Ig)E is commonly employed to identify allergens used for allergen‐specific immunotherapy in dogs, yet the reliability of results has been a matter of debate. Objective – The aim of this study was to evaluate the reproducibility of serum tests for environmental allergen‐specific IgE in ...
Katja N. Baumann +4 more
wiley +1 more source
Infant Mental Health Journal: Infancy and Early Childhood, Volume 42, Issue 1, Page 21-34, January/February 2021., 2021 ABSTRACT Parental reflective functioning (PRF) is an important predictor of infant attachment, and interventions that target parent–infant/toddler dyads who are experiencing significant problems have the potential to improve PRF. A range of dyadic interventions have been developed over the past two decades, some of which explicitly target PRF as part ...
Jane Barlow +2 more
wiley +1 more source
Optimal Embeddings of Distance Regular Graphs into Euclidean Spaces [PDF]
, 2007 In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least distortion for Hamming graphs, Johnson graphs, and all strongly regular graphs.
Bannai +11 more
core +9 more sources
Alternative SDP and SOCP approximations for polynomial optimization
EURO Journal on Computational Optimization, 2019 In theory, hierarchies of semidefinite programming (SDP) relaxations based on sum of squares (SOS) polynomials have been shown to provide arbitrarily close approximations for a general polynomial optimization problem (POP).
Xiaolong Kuang +3 more
doaj +1 more source
A bounded degree SOS hierarchy for polynomial optimization
EURO Journal on Computational Optimization, 2017 We consider a new hierarchy of semidefinite relaxations for the general polynomial optimization problem (P):f∗=min{f(x):x∈K} on a compact basic semi-algebraic set K⊂Rn.
JeanB. Lasserre +2 more
doaj +1 more source
Improving the linear relaxation of maximum k-cut with semidefinite-based constraints
EURO Journal on Computational Optimization, 2019 We consider the maximum k-cut problem that involves partitioning the vertex set of a graph into k subsets such that the sum of the weights of the edges joining vertices in different subsets is maximized.
VilmarJefté Rodrigues de Sousa +2 more
doaj +1 more source
Upper bounds for packings of spheres of several radii
Forum of Mathematics, Sigma, 2014 We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds for packings of
DAVID DE LAAT +2 more
doaj +1 more source