Results 1 to 10 of about 585 (68)
On Cones of Nonnegative Quadratic Functions [PDF]
, 2001 AMS classifications: 90C22 ...
Sturm, J.F., Zhang, S.
core +21 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
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 learning with Q-aggregation [PDF]
, 2013 We consider a general supervised learning problem with strongly convex and Lipshitz loss and study the problem of model selection aggre- gation. In particular, given a finite dictionary functions (learners) together with the prior, we generalize the ...
G. Lecu'e, P. Rigollet
semanticscholar +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
International Journal of Apllied Mathematics, 2019 In this paper we extended the results obtained for the first trigonometric kernel-function-based IPMs introduced by El Ghami et al. in [8] for LO to semidefinite optimization problems. The kernel function has a trigonometric Barrier Term.
M. E. Ghami, G. Q. Wang, T. Steihaug
semanticscholar +1 more source
THE GROTHENDIECK CONSTANT IS STRICTLY SMALLER THAN KRIVINE’S BOUND
Forum of Mathematics, Pi, 2013 The (real) Grothendieck constant ${K}_{G} $ is the infimum over those $K\in (0, \infty )$ such that for every $m, n\in \mathbb{N} $ and every $m\times n$ real matrix $({a}_{ij} )$ we have $$\begin{eqnarray*}\displaystyle \max _{\{ x_{i}\} _{i= 1}^{m} , \{
MARK BRAVERMAN +3 more
doaj +1 more source
Obstructions to determinantal representability [PDF]
, 2010 There has recently been ample interest in the question of which sets can be represented by linear matrix inequalities (LMIs). A necessary condition is that the set is rigidly convex, and it has been conjectured that rigid convexity is also sufficient. To
Borcea +15 more
core +2 more sources
Convergence of a short‐step primal‐dual algorithm based on the Gauss‐Newton direction
Journal of Applied Mathematics, Volume 2003, Issue 10, Page 517-534, 2003., 2003 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