We study the rates of growth of the regret in online convex optimization. First, we show that a simple extension of the algorithm of Hazan et al eliminates the need for a priori k...
—We study two convex optimization problems in a multi-class M/G/1 queue with adjustable service rates: minimizing convex functions of the average delay vector, and minimizing ave...
— A receding horizon control algorithm, originally proposed for tracking best-possible steady-states in the presence of overly stringent state and/or input constraints, is analyz...
Similarity measures in many real applications generate indefinite similarity matrices. In this paper, we consider the problem of classification based on such indefinite similariti...
A method for structural clustering proposed by the authors is extended to the case when there are externally de ned restrictions on the relations between sets and their elements. ...