An interior point method for linear programming

DOI10.1017/S033427000000672XMaRDI QIDQ3484625zbMATH OpenOpenAlexFDO

Authors Michael R. Osborne

Publication date 1990

Published in The Journal of the Australian Mathematical Society. Series B. Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s033427000000672x

zbMATH Keywords

accelerated convergenceinterior point methodKarmarkar algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Linear programming (90C05)

Recommendations

• scientific article; zbMATH DE number 223544
• scientific article; zbMATH DE number 946715
• scientific article; zbMATH DE number 5004702
• Some experiments with Karmarkar's algorithm for linear programming
• On the finite convergence of interior-point algorithms for linear programming

Cited in

(61)

• A multiplicative barrier function method for linear programming
• On finding a vertex solution using interior point methods
• An optimal-basis identification technique for interior-point linear programming algorithms
• Interior point algorithms for linear programming with inequality constraints
• Improving the rate of convergence of interior point methods for linear programming
• Integrability of vector and multivector fields associated with interior point methods for linear programming
• A polynomial method of approximate centers for linear programming
• On interior algorithms for linear programming with no regularity assumptions
• An estimate of Lagrange multipliers for linear programming using interior point methods
• A weighted least squares study of robustness in interior point linear programming
• Determination of an interior feasible point for a system of linear constraints
• Interior proximal point algorithm for linear programs
• Interior point methods of mathematical programming
• An interior linearization method
• An interior-point method for generalized linear-fractional programming
• A boundary-point LP solution method and its application to dense linear programs
• A still simpler way of introducing interior-point method for linear programming
• Optimized choice of parameters in interior-point methods for linear programming
• A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming
• Numerical inclusion of optimum point for linear programming
• An interior-point algorithm for solving inverse linear optimization problem
• scientific article; zbMATH DE number 4013884 (Why is no real title available?)
• scientific article; zbMATH DE number 5004702 (Why is no real title available?)
• scientific article; zbMATH DE number 4031392 (Why is no real title available?)
• scientific article; zbMATH DE number 4086908 (Why is no real title available?)
• scientific article; zbMATH DE number 4097127 (Why is no real title available?)
• Implementing cholesky factorization for interior point methods of linear programming
• Algorithmic Enhancements to the Method of Centers for Linear Programming Problems
• A Low Complexity Interior-Point Algorithm for Linear Programming
• An Interior-Point Algorithm for Linearly Constrained Optimization
• An Implementation of a Primal-Dual Interior Point Method for Linear Programming
• An interior point technique for solving bilevel programming problems
• Solving a linear multiperiod portfolio problem by interior-point methodology
• scientific article; zbMATH DE number 169371 (Why is no real title available?)
• scientific article; zbMATH DE number 1203366 (Why is no real title available?)
• Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
• scientific article; zbMATH DE number 617917 (Why is no real title available?)
• scientific article; zbMATH DE number 1069182 (Why is no real title available?)
• Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method
• scientific article; zbMATH DE number 1489799 (Why is no real title available?)
• PCx: an interior-point code for linear programming
• scientific article; zbMATH DE number 946715 (Why is no real title available?)
• An Interior Point Method for Bordered Block-Diagonal Linear Programs
• scientific article; zbMATH DE number 871033 (Why is no real title available?)
• scientific article; zbMATH DE number 5018770 (Why is no real title available?)
• A variation on the interior point method for linear programming using the continued iteration
• INTERIOR POINT METHOD FOR SOLVING LINEAR PROGRAMMING WITH INTERVAL COEFFICIENTS USING AFFINE SCALING
• scientific article; zbMATH DE number 223544 (Why is no real title available?)
• Interior point methods for large-scale linear programming
• Interior point algorithm for linear programming problem and related inscribed ellipsoids
• scientific article; zbMATH DE number 4185410 (Why is no real title available?)
• scientific article; zbMATH DE number 4189470 (Why is no real title available?)
• A regularized interior-point method for constrained linear least squares
• On first experiences with the implementation of a Newton based linear programming approach
• Solving linear systems in interior-point methods
• On a class of interior point algorithms
• On the finite convergence of interior-point algorithms for linear programming
• On the equivalence of the simplex methods and a multiplier-alike method for linear programming
• A unified view of interior point methods for linear programming
• Optimizing over three-dimensional subspaces in an interior-point method for linear programming
• Feasible region contraction interior point algorithm

This page was built for publication: An interior point method for linear programming

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