An Implementation of a Primal-Dual Interior Point Method for Linear Programming

DOI10.1287/ijoc.1.2.70zbMath0752.90047OpenAlexW2154951198MaRDI QIDQ4019974

Kevin A. McShane, David F. Shanno, Clyde l. Monma

Publication date: 16 January 1993

Published in: ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1.2.70

zbMATH Keywords

implementationprimal-dual interior point method

Mathematics Subject Classification ID

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

Related Items (55)

Interior dual proximal point algorithm for linear programs ⋮ Global convergence in infeasible-interior-point algorithms ⋮ Theoretical convergence of large-step primal-dual interior point algorithms for linear programming ⋮ Superlinear convergence of infeasible-interior-point methods for linear programming ⋮ Primal-dual algorithms for linear programming based on the logarithmic barrier method ⋮ Combining phase I and phase II in a potential reduction algorithm for linear programming ⋮ Unnamed Item ⋮ Status determination by interior-point methods for convex optimization problems in domain-driven form ⋮ Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization ⋮ A primal-dual interior-point method for linear programming based on a weighted barrier function ⋮ Linear programming with stochastic elements: An on-line approach ⋮ An interior multiobjective primal-dual linear programming algorithm based on approximated gradients and efficient anchoring points ⋮ A predictor-corrector method for extended linear-quadratic programming ⋮ Primal-dual methods for linear programming ⋮ An algorithm for linear programming that is easy to implement ⋮ On finding a vertex solution using interior point methods ⋮ Global convergence of the affine scaling methods for degenerate linear programming problems ⋮ Comparative analysis of affine scaling algorithms based on simplifying assumptions ⋮ Solving scalarized multi-objective network flow problems using an interior point method ⋮ Modified barrier functions (theory and methods) ⋮ A brief description of ALPO ⋮ Fortran subroutines for network flow optimization using an interior point algorithm ⋮ Interior Point Methods for Nonlinear Optimization ⋮ A little theorem of the big \({\mathcal M}\) in interior point algorithms ⋮ On the finite convergence of interior-point algorithms for linear programming ⋮ Convergence behavior of interior-point algorithms ⋮ On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise ⋮ On combined phase 1-phase 2 projective methods for linear programming ⋮ An easy way to teach interior-point methods. ⋮ Product-form Cholesky factorization in interior point methods for second-order cone programming ⋮ Near boundary behavior of primal-dual potential reduction algorithms for linear programming ⋮ An interior point method for quadratic programs based on conjugate projected gradients ⋮ Unnamed Item ⋮ Using approximate gradients in developing an interactive interior primal-dual multiobjective linear programming algorithm ⋮ Vector processing in simplex and interior methods for linear programming ⋮ A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood ⋮ \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria ⋮ A unified view of interior point methods for linear programming ⋮ Feasibility issues in a primal-dual interior-point method for linear programming ⋮ Advances in design and implementation of optimization software ⋮ Splitting dense columns in sparse linear systems ⋮ The theory of linear programming:skew symmetric self-dual problems and the central path^* ⋮ A primal-dual infeasible-interior-point algorithm for linear programming ⋮ Computational experience with a primal-dual interior point method for linear programming ⋮ Optimizing over three-dimensional subspaces in an interior-point method for linear programming ⋮ An extension of the potential reduction algorithm for linear complementarity problems with some priority goals ⋮ A multiobjective interior primal-dual linear programming algorithm ⋮ An \(O(n^ 3L)\) potential reduction algorithm for linear programming ⋮ Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited ⋮ Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems ⋮ Solving symmetric indefinite systems in an interior-point method for linear programming ⋮ A primal-dual affine-scaling potential-reduction algorithm for linear programming ⋮ On the convergence of a predictor-corrector variant algorithm ⋮ Interior-point methods for linear programming: a review ⋮ Active-set prediction for interior point methods using controlled perturbations

This page was built for publication: An Implementation of a Primal-Dual Interior Point Method for Linear Programming