In this paper, we study the incorporation of the support vector machine (SVM) into the (hierarchical) mixture of experts model to form a support vector mixture. We show that, in both classification and regression problems, the use of a support vector mixture leads to quadratic programming (QP) problems that are very similar to those for a SVM, with no increase in the dimensionality of the QP pr...

Let p be a fixed prime number. Throughout this paper Zp, Qp, and Cp will, respectively, denote the ring of p-adic rational integers, the field of p-adic rational numbers, and the completion of algebraic closure of Qp. For x ∈ Cp, we use the notation x q 1 − q / 1 − q . Let UD Zp be the space of uniformly differentiable functions on Zp, and let vp be the normalized exponential valuation of Cp wi...

Let p be a fixed prime number. Throughout this paper, the symbols Z, Zp, Qp, and Cp denote the ring of rational integers, the ring of p-adic integers, the field of p-adic rational numbers, and the completion of algebraic closure of Qp, respectively. Let N be the set of natural numbers, and Z N ∪ {0}. Let νp be the normalized exponential valuation of Cp with |p|p p−νp p p−1 see 1–24 . Let UD Zp ...

We present a method for accelerating GW quasi-particle (QP) calculations. This is achieved through the introduction of optimal basis sets for representing polarizability matrices. First the real-space products of Wannier like orbitals are constructed and then optimal basis sets are obtained through singular value decomposition. Our method is validated by calculating the vertical ionization ener...

Task-space quadratic programming (QP) is an elegant approach for controlling robots subject to constraints. Yet, in the case of kinematic-controlled (i.e., high-gain position or velocity) robots, closed-loop QP control scheme can be prone instability depending on how gains related tasks constraints are chosen. In this article, we address such shortcomings. First, highlight nonrobustness system ...

Let C be a bounded, closed, convex subset of a uniformly convex Banach space X. We investigate the convergence of the generalized Krasnosel’skiiMann and Ishikawa iteration processes to common fixed points of pointwise Lipschitzian semigroups of nonlinear mappings Tt : C → C. Each of Tt is assumed to be pointwise Lipschitzian, that is, there exists a family of functions αt : C → [0,∞) such that ...

In this paper we use the tools of the convex analysis in order to give a suitable characterization for the epigraph of the conjugate of the pointwise maximum of two proper, convex and lower semicontinuous functions in a normed space. By using this characterization we obtain, as a natural consequence, the formula for the biconjugate of the pointwise maximum of two functions, provided the so-call...

Let p be a fixed odd prime number. Throughout this paper, Zp, Qp, and Cp will denote the ring of p-adic rational integers, the field of p-adic rational numbers, and the completion of algebraic closure of Qp, respectively. The p-adic norm is normalized so that |p|p 1/p. Let N be the set of natural numbers and Z N ∪ {0}. Let UD Zp be the space of uniformly differentiable functions on Zp. For f ∈ ...