New Preconditioners for KKT Systems of Network Flow Problems

DOI10.1137/S105262340240519XMaRDI QIDQ4651974zbMATH OpenWikidataFDO

Authors Antonio Frangioni, Claudio Gentile

Publication date 23 February 2005

Published in SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S105262340240519X

zbMATH Keywords

interior point algorithmsmin cost flow problemspreconditioned conjugated gradient methodtriangulated graphs

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Linear programming (90C05) Programming involving graphs or networks (90C35) Interior-point methods (90C51)

Recommendations

• Prim-based support-graph preconditioners for min-cost flow problems
• A study of preconditioners for network interior point methods
• Preconditioners for Indefinite Systems Arising in Optimization
• Preconditioning indefinite systems in interior point methods for large scale linear optimisation
• scientific article; zbMATH DE number 992799

Cited in

(15)

• A study of preconditioners for network interior point methods
• A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
• New preconditioners for nonsymmetric saddle point systems with singular \((1,1)\) block
• Improving an interior-point approach for large block-angular problems by hybrid preconditioners
• Prim-based support-graph preconditioners for min-cost flow problems
• Interior-point solver for convex separable block-angular problems
• Improving an interior-point algorithm for multicommodity flows by quadratic regularizations
• Mathematical Programming and Electrical Network Analysis II: Computational Linear Algebra through Network analysis
• An affine scaling method for solving network flow problems
• On geometrical properties of preconditioners in IPMs for classes of block-angular problems
• Experiments with a hybrid interior point/combinatorial approach for network flow problems
• Direct solution of the normal equations in interior point methods for convex transportation problems
• Accelerated multigrid for graph Laplacian operators
• A regularized interior point method for sparse optimal transport on graphs
• Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems

Describes a project that uses

Uses Software

• PDNET
• TAUCS

This page was built for publication: New Preconditioners for KKT Systems of Network Flow Problems

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