Local Convergence Properties of New Methods in Linear Programming
From MaRDI portal
Recommendations
- Local behavior of the Newton method on two equivalent systems from linear programming
- Improving the rate of convergence of interior point methods for linear programming
- Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem
- Superlinear convergence of infeasible-interior-point methods for linear programming
- Insights into the interior-point methods
Cited in
(14)- Local behavior of the Newton method on two equivalent systems from linear programming
- Global convergence of the affine scaling methods for degenerate linear programming problems
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- Determination of an interior feasible point for a system of linear constraints
- Local convergence of filter methods for equality constrained non-linear programming
- Degeneracy in interior point methods for linear programming: A survey
- A semilocal convergence analysis for Newton LP methods
- Finite convergence of an active signature method to local minima of piecewise linear functions
- Local data processing algorithms in linear systems. Asymptotic behavior. Algorithms with strong processing at the end
- Improving the rate of convergence of interior point methods for linear programming
- On the big \({\mathcal M}\) in the affine scaling algorithm
- Local approximability of max-min and min-max linear programs
- Quadratic convergence of the Iri-Imai algorithm for degenerate linear programming problems
- Les effets de l'exposant de la fonction barrière multiplicative dans les méthodes de points intérieurs
This page was built for publication: Local Convergence Properties of New Methods in Linear Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3200876)
