697 search results - page 37 / 140 » Convex Functions on Discrete Sets |
JMLR
2010
13 years 7 months ago
2010
We extend the well-known BFGS quasi-Newton method and its memory-limited variant LBFGS to the optimization of nonsmooth convex objectives. This is done in a rigorous fashion by ge...
COR
2002
13 years 8 months ago
2002
This paper presents the fundamental theory and algorithms for identifying the most preferred alternative for a decision maker (DM) having a non-centrist (or extremist) preferentia...
TIT
2002
13 years 8 months ago
2002
We consider direct sequence code division multiple access (DS-CDMA), modeling interference from users communicating with neighboring base stations by additive colored noise. We con...
NIPS
2007
13 years 10 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
APN
2008
Springer
13 years 11 months ago
2008
Springer
In this paper, we address the class of bounded Petri nets with stopwatches (SwPNs), which is an extension of T-time Petri nets (TPNs) where time is associated with transitions. Con...