The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method
From MaRDI portal
Publication:4877505
DOI10.1137/0806004zbMath0846.65024OpenAlexW2082907018MaRDI QIDQ4877505
Matthew J. Saltzman, Alan Weiser, Richard A. Tapia, Yin Zhang
Publication date: 4 June 1996
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0806004
linear programmingcomposite Newton methodKojima-Mizuno-Yoshise primal-dual-methodMehrotra predictor-corrector method
Related Items
Sparse Approximations with Interior Point Methods, On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms, Asymptotic convergence in a generalized predictor-corrector method, Solving linear systems involved in constrained optimization, The implementation of linear programming algorithms based on homotopies, A Mehrotra-type predictor-corrector algorithm with polynomiality and \(Q\)-subquadratic convergence, Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming, An interior point method for quadratic programs based on conjugate projected gradients, Further development of multiple centrality correctors for interior point methods, Newton-type interior-point methods for solving generalized complementarity problems in polyhedral cones, Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†, Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems
