PDNET

swMATH4752MaRDI QIDQ16920FDOQ16920

Author name not available (Why is that?)

Described by source

• Fortran subroutines for network flow optimization using an interior point algorithm

Cited In (39)

• Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
• Title not available (Why is that?)
• Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods
• Sparsity preserving preconditioners for linear systems in interior-point methods
• A hybrid algorithm for the solution of a single commodity spatial equilibrium model
• Solving scalarized multi-objective network flow problems using an interior point method
• Minimum-cost flow algorithms: an experimental evaluation
• Symbiosis between linear algebra and optimization
• An Iterative Solver-Based Infeasible Primal-Dual Path-Following Algorithm for Convex Quadratic Programming
• The convergence of an interior-point method using modified search directions in final iterations
• Convergence Conditions and Krylov Subspace--Based Corrections for Primal-Dual Interior-Point Method
• Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
• A fast first-order optimization approach to elastoplastic analysis of skeletal structures
• Spectral analysis of (sequences of) graph matrices
• A Specialized Interior-Point Algorithm for Multicommodity Network Flows
• Perturbed path following predictor-corrector interior point algorithms
• Experiments with a hybrid interior point/combinatorial approach for network flow problems
• Semidefinite programming relaxations for the quadratic assignment problem
• A projected-gradient interior-point algorithm for complementarity problems
• Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation.
• Convergence of a class of inexact interior-point algorithms for linear programs
• A study of preconditioners for network interior point methods
• Title not available (Why is that?)
• New Preconditioners for KKT Systems of Network Flow Problems
• Inexact interior-point method
• A least-squares minimum-cost network flow algorithm
• Convergence analysis of an inexact infeasible interior point method for semidefinite programming
• Convergence analysis of an inexact potential reduction method for convex quadratic programming
• Title not available (Why is that?)
• Final iterations in interior point methods – preconditioned conjugate gradients and modified search directions
• Interior point methods for large-scale linear programming
• Prim-based support-graph preconditioners for min-cost flow problems
• A note on hybrid preconditioners for large-scale normal equations arising from interior-point methods
• Accelerated multigrid for graph Laplacian operators
• A review of termination rules of an inexact primal-dual interior point method for linear programming problems
• An iterative solver-based long-step infeasible primal-dual path-following algorithm for convex QP based on a class of preconditioners
• Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems
• Combinatorial preconditioners for scalar elliptic finite-element problems
• Large-Scale Scientific Computing

This page was built for software: PDNET