Sciweavers

77 search results - page 3 / 16
» A New Exchange Method for Convex Semi-Infinite Programming
Sort
View
DATE
2010
IEEE
129views Hardware» more  DATE 2010»
13 years 11 months ago
A power optimization method for CMOS Op-Amps using sub-space based geometric programming
—— A new sub-space max-monomial modeling scheme for CMOS transistors in sub-micron technologies is proposed to improve the modeling accuracy. Major electrical parameters of CMOS...
Wei Gao, Richard Hornsey
ICML
2006
IEEE
14 years 7 months ago
Discriminative unsupervised learning of structured predictors
We present a new unsupervised algorithm for training structured predictors that is discriminative, convex, and avoids the use of EM. The idea is to formulate an unsupervised versi...
Linli Xu, Dana F. Wilkinson, Finnegan Southey, Dal...
COCO
2005
Springer
141views Algorithms» more  COCO 2005»
13 years 11 months ago
Upper Bounds for Quantum Interactive Proofs with Competing Provers
Refereed games are interactive proof systems with two competing provers: one that tries to convince the verifier to accept and another that tries to convince the verifier to rej...
Gus Gutoski
SIAMJO
2011
13 years 1 months ago
A Unifying Polyhedral Approximation Framework for Convex Optimization
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
Dimitri P. Bertsekas, Huizhen Yu
AUTOMATICA
2006
132views more  AUTOMATICA 2006»
13 years 6 months ago
A new autocovariance least-squares method for estimating noise covariances
Industrial implementation of model-based control methods, such as model predictive control, is often complicated by the lack of knowledge about the disturbances entering the syste...
Brian J. Odelson, Murali R. Rajamani, James B. Raw...