Sciweavers

TCAD
1998
107views more  TCAD 1998»
13 years 3 months ago
Optimizing dominant time constant in RC circuits
— Conventional methods for optimal sizing of wires and transistors use linear resistor-capacitor (RC) circuit models and the Elmore delay as a measure of signal delay. If the RC ...
Lieven Vandenberghe, Stephen P. Boyd, Abbas A. El ...
CORR
2004
Springer
103views Education» more  CORR 2004»
13 years 3 months ago
Online convex optimization in the bandit setting: gradient descent without a gradient
We study a general online convex optimization problem. We have a convex set S and an unknown sequence of cost functions c1, c2, . . . , and in each period, we choose a feasible po...
Abraham Flaxman, Adam Tauman Kalai, H. Brendan McM...
AUTOMATICA
2004
128views more  AUTOMATICA 2004»
13 years 3 months ago
A convex optimization approach to the mode acceleration problem
The purpose of this note is to introduce an alternative procedure to the mode acceleration method when the underlying structure model includes damping. We will show that the probl...
S. O. Reza Moheimani, Dunant Halim
SIAMJO
2008
84views more  SIAMJO 2008»
13 years 3 months ago
Regularity Conditions via Quasi-Relative Interior in Convex Programming
We give some new regularity conditions for Fenchel duality in separated locally convex vector spaces, written in terms of the notion of quasi interior and quasi-relative interior, ...
Radu Ioan Bot, Ernö Robert Csetnek, Gert Wank...
JMLR
2006
124views more  JMLR 2006»
13 years 3 months ago
A Direct Method for Building Sparse Kernel Learning Algorithms
Many kernel learning algorithms, including support vector machines, result in a kernel machine, such as a kernel classifier, whose key component is a weight vector in a feature sp...
Mingrui Wu, Bernhard Schölkopf, Gökhan H...
AUTOMATICA
2007
129views more  AUTOMATICA 2007»
13 years 3 months ago
Robust control of polytopic systems by convex optimization
— Robust control synthesis of linear time-invariant SISO polytopic systems is investigated using the polynomial approach. A convex set of all stabilizing controllers for a polyto...
Alireza Karimi, Hamid Khatibi, Roland Longchamp
NIPS
2001
13 years 5 months ago
Boosting and Maximum Likelihood for Exponential Models
We derive an equivalence between AdaBoost and the dual of a convex optimization problem, showing that the only difference between minimizing the exponential loss used by AdaBoost ...
Guy Lebanon, John D. Lafferty
NIPS
2007
13 years 5 months ago
Bundle Methods for Machine Learning
We present a globally convergent method for regularized risk minimization problems. Our method applies to Support Vector estimation, regression, Gaussian Processes, and any other ...
Alex J. Smola, S. V. N. Vishwanathan, Quoc V. Le
SDM
2008
SIAM
133views Data Mining» more  SDM 2008»
13 years 5 months ago
A RELIEF Based Feature Extraction Algorithm
RELIEF is considered one of the most successful algorithms for assessing the quality of features due to its simplicity and effectiveness. It has been recently proved that RELIEF i...
Yijun Sun, Dapeng Wu
ICCAD
1998
IEEE
130views Hardware» more  ICCAD 1998»
13 years 7 months ago
GPCAD: a tool for CMOS op-amp synthesis
We present a method for optimizing and automating component and transistor sizing for CMOS operational amplifiers. We observe that a wide variety of performance measures can be fo...
Maria del Mar Hershenson, Stephen P. Boyd, Thomas ...