Reproducibility of serum testing for environmental allergen‐specific IgE in dogs in Europe
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
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
Convergence of a short‐step primal‐dual algorithm based on the Gauss‐Newton direction
We prove the theoretical convergence of a short‐step, approximate path‐following, interior‐point primal‐dual algorithm for semidefinite programs based on the Gauss‐Newton direction obtained from minimizing the norm of the perturbed optimality conditions. This is the first proof of convergence for the Gauss‐Newton direction in this context.
Serge Kruk, Henry Wolkowicz
wiley +1 more source
Optimization of Univariate Functions on Bounded Intervals by Interpolation and Semidefinite Programming [PDF]
AMS classifications: 65D05; 65K05 ...
den Hertog, D. +3 more
core
Semidefinite relaxation bounds for bi-quadratic optimization problems with quadratic constraints
Bi-quadratic optimization, Semidefinite programming relaxation, Approximation solution, Probabilistic solution, 15A69, 90C22, 90C26, 90C59,
Liqun Qi +5 more
core +1 more source
On Semidefinite Programming Relaxations of the Travelling Salesman Problem (Replaced by DP 2008-96) [PDF]
AMS classification: 90C22, 20Cxx, 70 ...
Sotirov, R.; id_orcid +4 more
core
Complex quadratic optimization and semidefinite programming
. In this paper we study the approximation algorithms for a class of discrete quadratic optimization problems in the Hermitian complex form. A special case of the problem that we study corresponds to the max-3-cut model used in a recent paper of Goemans ...
Shuzhong Zhang, Yongwei Huang
core +1 more source
Noisy tensor completion via the sum-of-squares hierarchy. [PDF]
Barak B, Moitra A.
europepmc +1 more source
Facial reduction for symmetry reduced semidefinite and doubly nonnegative programs. [PDF]
Hu H, Sotirov R, Wolkowicz H.
europepmc +1 more source
A Relaxed Interior Point Method for Low-Rank Semidefinite Programming Problems with Applications to Matrix Completion. [PDF]
Bellavia S, Gondzio J, Porcelli M.
europepmc +1 more source

