548 search results - page 19 / 110 » Optimization of Convex Risk Functions |
108
Voted
EOR
2008
15 years 14 days ago
2008
Our problem of interest consists of minimizing a separable, convex and differentiable function over a convex set, defined by bounds on the variables and an explicit constraint des...
114
Voted
IPCO
2010
14 years 10 months ago
2010
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumerati...
MOR
2006
15 years 10 days ago
2006
We apply the method known as simulated annealing to the following problem in convex optimization: minimize a linear function over an arbitrary convex set, where the convex set is ...
102
click to vote
SIAMJO
2011
14 years 7 months ago
2011
Abstract. We propose a unifying framework for polyhedral approximation in convex optimization. It subsumes classical methods, such as cutting plane and simplicial decomposition, bu...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
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,...