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

Rätsch, G

doi:10.1007/11893318_4

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

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

MPS-Authors

/persons/resource/persons84153

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

External Resource

https://link.springer.com/content/pdf/10.1007/11893318_4.pdf
(Publisher version)

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

Citation

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

Abstract

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.