Superlinear and quadratic convergence of primal-dual interior-point methods for linear programming revisited
From MaRDI portal
Publication:1321176
DOI10.1007/BF00940179zbMath0792.90078OpenAlexW2088888723MaRDI QIDQ1321176
Publication date: 25 July 1994
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00940179
Related Items
Superlinear convergence of infeasible-interior-point methods for linear programming, Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization, A primal-dual interior-point method for linear programming based on a weighted barrier function, A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence, On the formulation and theory of the Newton interior-point method for nonlinear programming, A superlinearly convergent wide-neighborhood predictor-corrector interior-point algorithm for linear programming, A step-truncated method in a wide neighborhood interior-point algorithm for linear programming, A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*, On finding a vertex solution using interior point methods, On the Newton interior-point method for nonlinear programming problems, Differential-algebraic approach to linear programming, On the convergence of a predictor-corrector variant algorithm
Cites Work
- Unnamed Item
- Computational experience with a primal-dual interior point method for linear programming
- Interior path following primal-dual algorithms. I: Linear programming
- A Centered Projective Algorithm for Linear Programming
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Large-Step Interior Point Algorithms for Linear Complementarity Problems
