Sciweavers

697 search results - page 41 / 140
» Convex Functions on Discrete Sets
Sort
View
VLSID
2008
IEEE
83views VLSI» more  VLSID 2008»
14 years 9 months ago
Efficient Linear Macromodeling via Discrete-Time Time-Domain Vector Fitting
We present a discrete-time time-domain vector fitting algorithm, called TD-VFz, for rational function macromodeling of port-to-port responses with discrete time-sampled data. The ...
Chi-Un Lei, Ngai Wong
CORR
2011
Springer
127views Education» more  CORR 2011»
13 years 19 days ago
Generalized Boosting Algorithms for Convex Optimization
Boosting is a popular way to derive powerful learners from simpler hypothesis classes. Following previous work (Mason et al., 1999; Friedman, 2000) on general boosting frameworks,...
Alexander Grubb, J. Andrew Bagnell
MP
2007
76views more  MP 2007»
13 years 8 months ago
Universal duality in conic convex optimization
Given a primal-dual pair of linear programs, it is well known that if their optimal values are viewed as lying on the extended real line, then the duality gap is zero, unless both...
Simon P. Schurr, André L. Tits, Dianne P. O...
SC
1995
ACM
14 years 12 days ago
A Performance Evaluation of the Convex SPP-1000 Scalable Shared Memory Parallel Computer
The Convex SPP-1000 is the first commercial implementation of a new generation of scalable shared memory parallel computers with full cache coherence. It employs a hierarchical s...
Thomas L. Sterling, Daniel Savarese, Peter MacNeic...
COLT
2010
Springer
13 years 6 months ago
Composite Objective Mirror Descent
We present a new method for regularized convex optimization and analyze it under both online and stochastic optimization settings. In addition to unifying previously known firstor...
John Duchi, Shai Shalev-Shwartz, Yoram Singer, Amb...