Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
type: Item
instance of: scholarly article
title: Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms
zbMATH Open document ID: 1121.90091
author: Maziar Salahi
author: Tamás Terlaky
published in: European Journal of Operational Research
publication date: 2007-05-30T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 5159517
zbMATH Keywords: linear optimization
zbMATH Keywords: predictor-corrector method
zbMATH Keywords: Mehrotra-type algorithm
zbMATH Keywords: polynomial complexity
zbMATH Keywords: superlinear convergence
describes a project that uses: XPRESS
describes a project that uses: McIPM
describes a project that uses: NETLIB LP Test Set
describes a project that uses: Mosek
describes a project that uses: CPLEX
describes a project that uses: LIPSOL
MaRDI profile type: Publication
full work available at URL: j.ejor.2006.08.044
OpenAlex ID: W1987085624
cites work: Q4496016
cites work: A New Infinity-Norm Path Following Algorithm for Linear Programming
cites work: Multiple centrality corrections in a primal-dual method for linear programming
cites work: Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path
cites work: An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
cites work: Q4206561
cites work: On finding a vertex solution using interior point methods
cites work: On the Implementation of a Primal-Dual Interior Point Method
cites work: Convergence Conditions and Krylov Subspace--Based Corrections for Primal-Dual Interior-Point Method
cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
cites work: A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
cites work: The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path
cites work: Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
cites work: Q4339096
cites work: On Mehrotra-Type Predictor-Corrector Algorithms
cites work: Q3738934
cites work: Q5691079
cites work: On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
cites work: Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
DOI: 10.1016/J.EJOR.2006.08.044
description: scientific article; zbMATH DE number 5159517