An interior point algorithm for semi-infinite linear programming
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3631469 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 3301975 (Why is no real title available?)
- A modification of Karmarkar's linear programming algorithm
- A new polynomial-time algorithm for linear programming
- A variation on Karmarkar’s algorithm for solving linear programming problems
- An implementation of Karmarkar's algorithm for linear programming
- Convergence results and numerical experiments on a linear programming hybrid algorithm
- Linear optimization and approximation. An introduction to the theoretical analysis and numerical treatment of semi-infinite programs. Transl. from the German
Cited in
(27)- A ladder method for linear semi-infinite programming
- Model reduction of uncertain systems retaining the uncertainty structure
- An inexact approach to solving linear semi-infinite programming problems
- Suggested research topics in sensitivity and stability analysis for semi- infinite programming problems
- scientific article; zbMATH DE number 1489799 (Why is no real title available?)
- Computation of the collapse state in limit analysis using the LP primal affine scaling algorithm
- Proximal interior point method for convex semi-infinite programming
- The \(L_q\)-weighted dual programming of the linear Chebyshev approximation and an interior-point method
- On affine scaling and semi-infinite programming
- LP relaxations for a class of linear semi-infinite programming problems
- An interior-point method for semi-infinite programming problems
- An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs
- Interior-Point Algorithms for Semidefinite Programming Problems Derived from the KYP Lemma
- Relaxed cutting plane method for solving linear semi-infinite programming problems
- A homotopy interior point method for semi-infinite programming problems
- Implementation of an inexact approach to solving linear semi-infinite programming problems
- An Interior Point Method for Bordered Block-Diagonal Linear Programs
- Linear programming, complexity theory and elementary functional analysis
- scientific article; zbMATH DE number 3854364 (Why is no real title available?)
- A globally convergent method for semi-infinite linear programming
- Solving quadratic semi-infinite programming problems by using relaxed cutting-plane scheme
- Combined entropic regularization and path-following method for solving finite convex min-max problems subject to infinitely many linear constraints
- scientific article; zbMATH DE number 5968557 (Why is no real title available?)
- On the numerical treatment of linearly constrained semi-infinite optimization problems
- scientific article; zbMATH DE number 108319 (Why is no real title available?)
- Interior-point algorithms for semi-infinite programming
- An interior point constraint generation algorithm for semi-infinite optimization with health-care application
This page was built for publication: An interior point algorithm for semi-infinite linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1123804)
