A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
From MaRDI portal
Publication:2029899
DOI10.1016/j.ejor.2020.10.027zbMath1487.90641OpenAlexW2921632820MaRDI QIDQ2029899
Publication date: 4 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/351220
large-scale optimizationinterior-point methodspreconditioned conjugate gradientminimum cost flow problems
Programming involving graphs or networks (90C35) Large-scale problems in mathematical programming (90C06) Interior-point methods (90C51) Deterministic network models in operations research (90B10)
Related Items
An adaptive nonmonotone line search for multiobjective optimization problems, Solving nonsmooth and discontinuous optimal power flow problems via interior-point \(\ell_p\)-penalty approach, Multi-market portfolio optimization with conditional value at risk, Time-flexible min completion time variance in a single machine by quadratic programming, An almost exact solution to the min completion time variance in a single machine
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Acceleration strategies of Benders decomposition for the security constraints power system expansion planning
- Clustering-based preconditioning for stochastic programs
- An adaptive augmented Lagrangian method for large-scale constrained optimization
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
- Quadratic regularizations in an interior-point method for primal block-angular problems
- Convergence behavior of interior-point algorithms
- Collaborative transportation with overlapping coalitions
- Matching is as easy as matrix inversion
- A polynomial time primal network simplex algorithm for minimum cost flows
- Introductory lectures on convex optimization. A basic course.
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- Preconditioning indefinite systems in interior point methods for optimization
- An integrated planning model in centralized power systems
- A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems
- Interior-point solver for convex separable block-angular problems
- Convergence Analysis of an Inexact Feasible Interior Point Method for Convex Quadratic Programming
- Minimum-cost flow algorithms: an experimental evaluation
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- Finding Minimum-Cost Circulations by Successive Approximation
- Finding minimum-cost circulations by canceling negative cycles
- Testing of a large-scale network optimization program
- A Specialized Interior-Point Algorithm for Multicommodity Network Flows
- New Preconditioners for KKT Systems of Network Flow Problems
- A Matrix-Free Preconditioner for Sparse Symmetric Positive Definite Systems and Least-Squares Problems
- On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems
- Minimum Concave Cost Flows in Certain Networks
- A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
