Exploiting special structure in a primal-dual path-following algorithm

DOI10.1007/BF01581258MaRDI QIDQ1803615zbMATH OpenOpenAlexFDO

Authors Donald Goldfarb, In-Chan Choi

Publication date 29 June 1993

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

Full work available at URL https://doi.org/10.1007/bf01581258

zbMATH Keywords

interior point methodupper boundsstructured linear programprimal-dual path- following algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic network models in operations research (90B10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• Interior path following primal-dual algorithms. I: Linear programming
• A primal-dual simplex method for linear programs
• An implementation of a parallel primal-dual interior point method for block- structured linear programs
• Publication:4864972
• scientific article; zbMATH DE number 724217

Cites work

• scientific article; zbMATH DE number 4131946 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (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 POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS
• A new polynomial-time algorithm for linear programming
• A polynomial-time algorithm, based on Newton's method, for linear programming
• A variation on Karmarkar’s algorithm for solving linear programming problems
• An Efficient Heuristic Procedure for Partitioning Graphs
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• Computational experience with a primal-dual interior point method for linear programming
• Computing Block-Angular Karmarkar Projections with Applications to Stochastic Programming
• Depth-First Search and Linear Graph Algorithms
• Exploiting special structure in Karmarkar's linear programming algorithm
• Further Development of a Primal-Dual Interior Point Method
• Interior path following primal-dual algorithms. I: Linear programming
• On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
• On the Implementation of a Primal-Dual Interior Point Method
• POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS
• Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
• Speeding up Karmarkar's algorithm for multicommodity flows

Cited in

(12)

• Interior point methods 25 years later
• Exploiting Special Structure in Primal Dual Interior Point Methods
• Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
• A cutting plane method from analytic centers for stochastic programming
• scientific article; zbMATH DE number 847159 (Why is no real title available?)
• Parallel interior-point solver for block-structured nonlinear programs on SIMD/GPU architectures
• scientific article; zbMATH DE number 3892507 (Why is no real title available?)
• Using an interior point method for the master problem in a decomposition approach
• Interior-point methods with decomposition for solving large-scale linear programs
• A primal-dual decomposition algorithm for multistage stochastic convex programming
• Design and implementation of a modular interior-point solver for linear optimization
• Modified primal path-following scheme for the monotone variational inequality problem

This page was built for publication: Exploiting special structure in a primal-dual path-following algorithm

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