Solving Semi-infinite Linear Programs Using Boosting-Like Methods

DOI10.1007/11894841_2zbMATH Open1168.68490DBLPconf/alt/Ratsch06OpenAlexW1573622490WikidataQ57525533 ScholiaQ57525533MaRDI QIDQ3522972FDOQ3522972

Authors: Gunnar Rätsch 

Publication date: 4 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11894841_2

Recommendations

• Linear programming boosting via column generation
• A one-phase algorithm for semi-infinite linear programming
• An extension of the simplex algorithm for semi-infinite linear programming
• A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs
• LP relaxations for a class of linear semi-infinite programming problems

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Linear programming (90C05)

Cited In (1)

• Linear programming boosting via column generation

This page was built for publication: Solving Semi-infinite Linear Programs Using Boosting-Like Methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522972)