Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

The Solution of Semi-Infinite Linear Programs Using Boosting-Like Methods


Rätsch,  G
Rätsch Group, Friedrich Miescher Laboratory, Max Planck Society;

External Resource
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Rätsch, G. (2006). The Solution of Semi-Infinite Linear Programs Using Boosting-Like Methods. In L. Todorovsky, N. Lavrač, & K. Jantke (Eds.), Discovery Science: 9th International Conference, DS 2006, Barcelona, Spain, October 7-10, 2006 (pp. 15). Berlin, Germany: Springer.

Cite as: https://hdl.handle.net/21.11116/0000-000A-DA55-1
We consider methods for the solution of large linear optimization problems, in particular so-called Semi-Infinite Linear Programs (SILPs) that have a finite number of variables but infinitely many linear constraints. We illustrate that such optimization problems frequently appear in machine learning and discuss several examples including maximum margin boosting, multiple kernel learning and structure learning. In the second part we review methods for solving SILPs. Here, we are particularly interested in methods related to boosting. We review recent theoretical results concerning the convergence of these algorithms and conclude this work with a discussion of empirical results comparing these algorithms.