An interior-point method for semi-infinite programming problems

DOI10.1007/BF02206820zbMath0848.90115OpenAlexW1970540323MaRDI QIDQ1915915

Ulrich Schättler

Publication date: 1 July 1996

Published in: Annals of Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

interior-point methodpredictor-corrector methodmethod of analytic centerssemi-infinite linear programming

Mathematics Subject Classification ID

Semi-infinite programming (90C34)

Related Items (2)

Convergent Algorithms for a Class of Convex Semi-infinite Programs ⋮ Proximal interior point method for convex semi-infinite programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
• A new polynomial-time algorithm for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• An interior point algorithm for semi-infinite linear programming
• On the complexity of following the central path of linear programs by linear extrapolation. II
• On affine scaling and semi-infinite programming
• Semi-infinite programming and applications. An International Symposium, Austin, Texas, September 8-10, 1981
• A note on singular minimax approximation problems

This page was built for publication: An interior-point method for semi-infinite programming problems