255 search results - page 4 / 51 » Generalized Boosting Algorithms for Convex Optimization |
107
click to vote
ICML
2003
IEEE
16 years 11 days ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...
103
click to vote
COLT
2005
Springer
15 years 5 months ago
2005
Springer
We present a general decomposition algorithm that is uniformly applicable to every (suitably normalized) instance of Convex Quadratic Optimization and efficiently approaches an o...
124
click to vote
IOR
2011
14 years 6 months ago
2011
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We prop...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
This paper describes a general framework for converting online game playing algorithms into constrained convex optimization algorithms. This framework allows us to convert the wel...
NIPS
2007
15 years 1 months ago
2007
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...