Reoptimization With the Primal-Dual Interior Point Method
- 1 January 2002
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 13 (3) , 842-864
- https://doi.org/10.1137/s1052623401393141
Abstract
No abstract availableThis publication has 16 references indexed in Scilit:
- Warm-Start Strategies in Interior-Point Methods for Linear ProgrammingSIAM Journal on Optimization, 2002
- Computational Experience with an Interior Point Cutting Plane AlgorithmSIAM Journal on Optimization, 2000
- Multiple centrality corrections in a primal-dual method for linear programmingComputational Optimization and Applications, 1996
- On the Implementation of a Primal-Dual Interior Point MethodSIAM Journal on Optimization, 1992
- Solving combinatorial optimization problems using Karmarkar's algorithmMathematical Programming, 1992
- New crash procedures for large systems of linear constraintsMathematical Programming, 1989
- Cross decomposition for mixed integer programmingMathematical Programming, 1983
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962
- The Decomposition Algorithm for Linear ProgramsEconometrica, 1961
- The Cutting-Plane Method for Solving Convex ProgramsJournal of the Society for Industrial and Applied Mathematics, 1960