Improving an interior-point algorithm for multicommodity flows by quadratic regularizations
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 910908
- scientific article; zbMATH DE number 2102040
- A PARALLEL PRIMAL-DUAL INTERIOR POINT METHOD FOR MULTICOMMODITY FLOW PROBLEMS WITH QUADRATIC COSTS
- A Specialized Interior-Point Algorithm for Multicommodity Network Flows
- scientific article; zbMATH DE number 4199934
- Faster approximate multicommodity flow using quadratically coupled flows
- scientific article; zbMATH DE number 2080144
- An interior point-proximal method of multipliers for convex quadratic programming
- Solving difficult multicommodity problems with a specialized interior-point algorithm
- A New Practically Efficient Interior Point Method for Convex Quadratic Programming
Cites work
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- A bundle-type algorithm for routing in telecommunication data networks
- A Specialized Interior-Point Algorithm for Multicommodity Network Flows
- A survey of algorithms for convex multicommodity flow 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
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- An interior-point approach for primal block-angular problems
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- Existence, uniqueness, and convergence of the regularized primal-dual central path
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Implementing a proximal algorithm for some nonlinear multicommodity flow problems
- Interior proximal point algorithm for linear programs
- Introductory lectures on convex optimization. A basic course.
- New Preconditioners for KKT Systems of Network Flow Problems
- Potential function methods for approximately solving linear programming problems: theory and practice.
- Progress Made in Solving the Multicommodity Flow Problem
- Quadratic regularizations in an interior-point method for primal block-angular problems
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems
- Solving difficult multicommodity problems with a specialized interior-point algorithm
- Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
- Solving nonlinear multicommodity flow problems by the analytic center cutting plane method
Cited in
(7)- Solving difficult multicommodity problems with a specialized interior-point algorithm
- Large-scale optimization with the primal-dual column generation method
- scientific article; zbMATH DE number 2102040 (Why is no real title available?)
- scientific article; zbMATH DE number 910908 (Why is no real title available?)
- Quadratic regularizations in an interior-point method for primal block-angular problems
- Accelerated multigrid for graph Laplacian operators
- Analyzing quadratic unconstrained binary optimization problems via multicommodity flows
This page was built for publication: Improving an interior-point algorithm for multicommodity flows by quadratic regularizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892150)
