scientific article; zbMATH DE number 1444279
From MaRDI portal
Publication:4953319
Recommendations
- scientific article; zbMATH DE number 515933
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- An efficient implementation of the network simplex method
- scientific article; zbMATH DE number 4174642
Cites work
- A new approach to the maximum-flow problem
- A new polynomial-time algorithm for linear programming
- A primal-dual infeasible-interior-point algorithm for linear programming
- A Short-Cut Potential Reduction Algorithm for Linear Programming
- A simplified global convergence proof of the affine scaling algorithm
- A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- An efficient implementation of the network simplex method
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- An Investigation of Interior-Point Algorithms for the Linear Transportation Problem
- Computational results of an interior point algorithm for large scale linear programming
- Convergence behavior of interior-point algorithms
- Convergence of a class of inexact interior-point algorithms for linear programs
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- Finding an interior point in the optimal face of linear programs
- Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 53116 (Why is no real title available?)
- scientific article; zbMATH DE number 679872 (Why is no real title available?)
- Inexact Newton Methods
- Interior path following primal-dual algorithms. I: Linear programming
- On the finite convergence of interior-point algorithms for linear programming
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Rejoinder—The Last Word on Interior Point Methods for Linear Programming—For Now
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
- Testing of a large-scale network optimization program
- The simplex SON algorithm for LP/embedded network problems
- Truncated-Newton algorithms for large-scale unconstrained optimization
Cited in
(23)- Inexact interior-point method
- Symbiosis between linear algebra and optimization
- A hybrid algorithm for the solution of a single commodity spatial equilibrium model
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
- A fast first-order optimization approach to elastoplastic analysis of skeletal structures
- Convergence analysis of an inexact potential reduction method for convex quadratic programming
- Prim-based support-graph preconditioners for min-cost flow problems
- Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
- Solving scalarized multi-objective network flow problems using an interior point method
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- scientific article; zbMATH DE number 679872 (Why is no real title available?)
- An annotated bibliography of network interior point methods
- Perturbed path following predictor-corrector interior point algorithms
- Fortran subroutines for network flow optimization using an interior point algorithm
- Sparsity preserving preconditioners for linear systems in interior-point methods
- A review of termination rules of an inexact primal-dual interior point method for linear programming problems
- Experiments with a hybrid interior point/combinatorial approach for network flow problems
- A projected-gradient interior-point algorithm for complementarity problems
- A least-squares minimum-cost network flow algorithm
- Accelerated multigrid for graph Laplacian operators
- A regularized interior point method for sparse optimal transport on graphs
- A modified PRP conjugate gradient method with inertial extrapolation for sparse signal reconstruction
- Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4953319)
