Improving an interior-point algorithm for multicommodity flows by quadratic regularizations

DOI10.1002/net.20483zbMath1245.90081OpenAlexW2167686030MaRDI QIDQ2892150

Jordi Castro, Jordi Cuesta

Publication date: 18 June 2012

Published in: Networks (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/9884

zbMATH Keywords

preconditioned conjugate gradientregularizationslarge-scale computational optimizationmulticommodity network flows

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Quadratic programming (90C20) Interior-point methods (90C51)

Related Items (2)

Large-scale optimization with the primal-dual column generation method ⋮ Accelerated multigrid for graph Laplacian operators

Uses Software

• KORBX
• PPRN
• IPM

Cites Work

• Unnamed Item
• Existence, uniqueness, and convergence of the regularized primal-dual central path
• Quadratic regularizations in an interior-point method for primal block-angular problems
• ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
• An implementation of linear and nonlinear multicommodity network flows
• Interior proximal point algorithm for linear programs
• Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
• Introductory lectures on convex optimization. A basic course.
• Solving difficult multicommodity problems with a specialized interior-point algorithm
• Potential function methods for approximately solving linear programming problems: theory and practice.
• An interior-point approach for primal block-angular problems
• A bundle-type algorithm for routing in telecommunication data networks
• A Survey of Algorithms for Convex Multicommodity Flow Problems
• An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
• Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
• Implementing a proximal algorithm for some nonlinear multicommodity flow problems
• Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems
• Progress Made in Solving the Multicommodity Flow Problem
• Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
• A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
• Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
• A Specialized Interior-Point Algorithm for Multicommodity Network Flows
• New Preconditioners for KKT Systems of Network Flow Problems

This page was built for publication: Improving an interior-point algorithm for multicommodity flows by quadratic regularizations