An Interior Point Method for Block Angular Optimization
From MaRDI portal
Publication:4012437
convergenceinterior point methodlarge-scale linear programmingmulticommodity flow problemsblock angular optimizationparallel numerical methods
Parallel numerical computation (65Y05) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Recommendations
- Parallel solution of large-scale, block-angular linear programs
- An implementation of a parallel primal-dual interior point method for block- structured linear programs
- An interior-point approach for primal block-angular problems
- A parallel interior point method and its application to facility location problems
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners
Cited in
(22)- Multicommodity network flows: A survey. II: Solution methods
- Interior point methods 25 years later
- Inexact coordinate descent: complexity and preconditioning
- A COMPARATIVE STUDY OF PARALLEL DECOMPOSITIONS FOR MULTICOMMODITY FLOW PROBLEMS∗
- PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
- Block-angular linear ratio programmes
- A smooth penalty function algorithm for network-structured problems
- Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems
- Experience in organizing hybrid parallel calculations in the Evtushenko-Golikov method for problems with block-angular structure
- Interior-point solver for convex separable block-angular problems
- Parallel solution of large-scale, block-angular linear programs
- Proximal minimizations with D-functions and the massively parallel solution of linear network programs
- Active set methods for problems in column block angular form
- Alternating direction splittings for block angular parallel optimization
- A bundle-type algorithm for routing in telecommunication data networks
- An implementation of a parallel primal-dual interior point method for block- structured linear programs
- A minimum mean cycle cancelling method for nonlinear multicommodity flow problems
- Partitioning mathematical programs for parallel solution
- Design and implementation of a modular interior-point solver for linear optimization
- Dynamic control of multicommodity fleet management problems
- Multicommodity network flows: The impact of formulation on decomposition
- An interior-point approach for primal block-angular problems
This page was built for publication: An Interior Point Method for Block Angular Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4012437)
