An interior-point method for semi-infinite programming problems
type: Item
instance of: scholarly article
title: An interior-point method for semi-infinite programming problems
zbMATH Open document ID: 0848.90115
DOI: 10.1007/BF02206820
author: Ulrich Schättler
published in: Annals of Operations Research
publication date: 1996-07-01T00:00:00Z
Mathematics Subject Classification ID: 90C34
zbMATH DE Number: 894987
zbMATH Keywords: interior-point method
zbMATH Keywords: method of analytic centers
zbMATH Keywords: semi-infinite linear programming
zbMATH Keywords: predictor-corrector method
MaRDI profile type: Publication
cites work: Q4060253
cites work: Semi-infinite programming and applications. An International Symposium, Austin, Texas, September 8-10, 1981
cites work: An interior point algorithm for semi-infinite linear programming
cites work: On affine scaling and semi-infinite programming
cites work: Q4175044
cites work: Q3939127
cites work: Q3995706
cites work: Q3827797
cites work: A new polynomial-time algorithm for linear programming
cites work: A note on singular minimax approximation problems
cites work: A polynomial-time algorithm, based on Newton's method, for linear programming
cites work: Q3738934
cites work: Global ellipsoidal approximations and homotopy methods for solving convex analytic programs
cites work: On the complexity of following the central path of linear programs by linear extrapolation. II
full work available at URL: https://doi.org/10.1007/bf02206820
OpenAlex ID: W1970540323
description: scientific article; zbMATH DE number 894987