Abstract Copositive optimization is a special case of convex conic programming, and it consists optimizing linear function over the cone all completely positive matrices under constraints. provides powerful relaxations NP-hard quadratic problems or combinatorial problems, but there are still many open regarding copositive matrices. In this paper, we focus on one such problem; finding (CP) facto...

We describe the use of smoothing spline analysis of variance (SSANOVA) in the penalized log likelihood context, for learning (estimating) the probability p of a '1' outcome, given a training set with attribute vectors and outcomes. p is of the form pet) = eJ(t) /(1 + eJ(t)), where, if t is a vector of attributes, f is learned as a sum of smooth functions of one attribute plus a sum of smooth fu...

This paper concerns the forecasting of seasonal intraday time series. An extension of Holt-Winters exponential smoothing has been proposed that smoothes an intraday cycle and an intraweek cycle. A recently proposed exponential smoothing method involves smoothing a different intraday cycle for each distinct type of day of the week. Similar days are allocated identical intraday cycles. A limitati...