An interior point algorithm for semi-infinite linear programming

DOI10.1007/BF01582293zbMath0677.90044MaRDI QIDQ1123804

Michael C. Ferris, Andy B. Philpott

Publication date: 1989

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

Hilbert spaceapproximationsemi-infinite linear programmingprojective interior point method

Mathematics Subject Classification ID

Linear programming (90C05) Best approximation, Chebyshev systems (41A50) Programming in abstract spaces (90C48) Semi-infinite programming (90C34)

Related Items (17)

LP relaxations for a class of linear semi-infinite programming problems ⋮ Interior-point algorithms for semi-infinite programming ⋮ Implementation of an inexact approach to solving linear semi-infinite programming problems ⋮ An interior-point method for semi-infinite programming problems ⋮ A ladder method for linear semi-infinite programming ⋮ Linear programming, complexity theory and elementary functional analysis ⋮ A globally convergent method for semi-infinite linear programming ⋮ Relaxed cutting plane method for solving linear semi-infinite programming problems ⋮ On the numerical treatment of linearly constrained semi-infinite optimization problems ⋮ On affine scaling and semi-infinite programming ⋮ An inexact approach to solving linear semi-infinite programming problems ⋮ Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme ⋮ Proximal interior point method for convex semi-infinite programming ⋮ Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems ⋮ Model reduction of uncertain systems retaining the uncertainty structure ⋮ Computation of the collapse state in limit analysis using the LP primal affine scaling algorithm ⋮ Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints

Cites Work

• A modification of Karmarkar's linear programming algorithm
• Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
• A new polynomial-time algorithm for linear programming
• Convergence results and numerical experiments on a linear programming hybrid algorithm
• An implementation of Karmarkar's algorithm for linear programming
• A variation on Karmarkar’s algorithm for solving linear programming problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An interior point algorithm for semi-infinite linear programming