Sciweavers

1118 search results - page 39 / 224
» Convex Optimization
Sort
View
NIPS
2007
15 years 5 months ago
Adaptive Online Gradient Descent
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...
Peter L. Bartlett, Elad Hazan, Alexander Rakhlin
INFOCOM
2012
IEEE
13 years 6 months ago
Delay and rate-optimal control in a multi-class priority queue with adjustable service rates
—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...
Chih-Ping Li, Michael J. Neely
CDC
2009
IEEE
379views Control Systems» more  CDC 2009»
15 years 7 months ago
Receding horizon cost optimization for overly constrained nonlinear plants
— 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...
David Angeli, Rishi Amrit, James B. Rawlings
ICML
2009
IEEE
16 years 5 months ago
Learning kernels from indefinite similarities
Similarity measures in many real applications generate indefinite similarity matrices. In this paper, we consider the problem of classification based on such indefinite similariti...
Yihua Chen, Maya R. Gupta, Benjamin Recht
APPML
2002
87views more  APPML 2002»
15 years 4 months ago
Induced layered clusters, hereditary mappings, and convex geometries
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. ...
Boris Mirkin, Ilya B. Muchnik