Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
type: Item
instance of: scholarly article
title: Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
zbMATH Open document ID: 1397.90398
author: Zsolt Darvay
author: Petra-Renáta Takács
published in: CEJOR. Central European Journal of Operations Research
publication date: 2018-10-05T00:00:00Z
Mathematics Subject Classification ID: 90C51
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 6948087
zbMATH Keywords: linear programming
zbMATH Keywords: large-step algorithm
zbMATH Keywords: wide neighbourhood
zbMATH Keywords: polynomial complexity
MaRDI profile type: Publication
full work available at URL: s10100-018-0524-0
OpenAlex ID: W2793154127
cites work: An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
cites work: A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
cites work: An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
cites work: A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
cites work: Q3415802
cites work: A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
cites work: A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
cites work: Q4362984
cites work: EP theorem for dual linear complementarity problems
cites work: A polynomial path-following interior point algorithm for general linear complementarity problems
cites work: Polynomial interior point algorithms for general linear complementarity problems
cites work: A new polynomial-time algorithm for linear programming
cites work: A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
cites work: A unified approach to interior point algorithms for linear complementary problems
cites work: Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
cites work: A New Class of Large Neighborhood Path-Following Interior Point Algorithms for Semidefinite Optimization with $O(\sqrt{n}\log\frac{\mathrm{Tr}(X^0S^0)}{\epsilon})$ Iteration Complexity
cites work: An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
cites work: A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
cites work: Q4791754
cites work: An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization
cites work: The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path
cites work: A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
cites work: Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
cites work: Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
cites work: Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
cites work: Primal-dual target-following algorithms for linear programming
cites work: Q3738934
cites work: Parallel search paths for the simplex algorithm
cites work: Q5691079
cites work: A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
cites work: Q4382667
DOI: 10.1007/S10100-018-0524-0
description: scientific article; zbMATH DE number 6948087