Exploiting special structure in a primal-dual path-following algorithm
DOI10.1007/BF01581258zbMATH Open0793.90031OpenAlexW1975916211MaRDI QIDQ1803615FDOQ1803615
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
Recommendations
Linear programming (90C05) Deterministic network models in operations research (90B10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Cites Work
- 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
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- An Efficient Heuristic Procedure for Partitioning Graphs
- Title not available (Why is that?)
- Depth-First Search and Linear Graph Algorithms
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- An \(O(n^ 3L)\) potential reduction algorithm for linear programming
- Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function
- Computational experience with a primal-dual interior point method for linear programming
- Title not available (Why is that?)
- Computing Block-Angular Karmarkar Projections with Applications to Stochastic Programming
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Title not available (Why is that?)
- Further Development of a Primal-Dual Interior Point Method
- Exploiting special structure in Karmarkar's linear programming algorithm
- A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS
- Speeding up Karmarkar's algorithm for multicommodity flows
- POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS
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
- Title not available (Why is that?)
- Parallel interior-point solver for block-structured nonlinear programs on SIMD/GPU architectures
- Title not available (Why is that?)
- 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)
