scientific article; zbMATH DE number 1444279
From MaRDI portal
Publication:4953319
DOI<91::AID-NET1>3.0.CO;2-T 10.1002/(SICI)1097-0037(200003)35:2<91::AID-NET1>3.0.CO;2-TzbMath0957.90022MaRDI QIDQ4953319
Geraldo Veiga, Luis F. Portugal, Joaquim Joao Júdice, Mauricio G. C. Resende
Publication date: 2 April 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
linear programminginterior point methodnetwork flowsconjugate gradientmaximum flowtruncated Newton methodexperimental testing of algorithmsprimal-infeasible dual-feasible
Linear programming (90C05) Methods of quasi-Newton type (90C53) Interior-point methods (90C51) Deterministic network models in operations research (90B10)
Related Items
A fast first-order optimization approach to elastoplastic analysis of skeletal structures, Prim-based support-graph preconditioners for min-cost flow problems, Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods, A hybrid algorithm for the solution of a single commodity spatial equilibrium model, Inexact interior-point method, Computational evaluation of multi-iterative approaches for solving graph-structured large linear systems, A projected-gradient interior-point algorithm for complementarity problems, A least-squares minimum-cost network flow algorithm, Solving scalarized multi-objective network flow problems using an interior point method, Sparsity preserving preconditioners for linear systems in interior-point methods, Accelerated multigrid for graph Laplacian operators, Fortran subroutines for network flow optimization using an interior point algorithm, Convergence analysis of an inexact potential reduction method for convex quadratic programming, Experiments with a hybrid interior point/combinatorial approach for network flow problems, Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning, Unnamed Item, Symbiosis between linear algebra and optimization, Perturbed path following predictor-corrector interior point algorithms
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- On the finite convergence of interior-point algorithms for linear programming
- Convergence behavior of interior-point algorithms
- A new polynomial-time algorithm for linear programming
- An algorithm for linear programming which requires \(O(((m+n)n^ 2+(m+n)^{1.5}n)L)\) arithmetic operations
- Interior path following primal-dual algorithms. I: Linear programming
- Computational results of an interior point algorithm for large scale linear programming
- A simplified global convergence proof of the affine scaling algorithm
- A primal-dual infeasible-interior-point algorithm for linear programming
- Finding an interior point in the optimal face of linear programs
- Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs
- Truncated-Newton algorithms for large-scale unconstrained optimization
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- An efficient implementation of the network simplex method
- A new approach to the maximum-flow problem
- Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems
- The simplex SON algorithm for LP/embedded network problems
- Inexact Newton Methods
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- Testing of a large-scale network optimization program
- A Short-Cut Potential Reduction Algorithm for Linear Programming
- Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art
- Rejoinder—The Last Word on Interior Point Methods for Linear Programming—For Now
- A Study of Indicators for Identifying Zero Variables in Interior-Point Methods
- Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems
- An Investigation of Interior-Point Algorithms for the Linear Transportation Problem
