Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
From MaRDI portal
Publication:1787924
DOI10.1007/s10100-018-0524-0zbMath1397.90398OpenAlexW2793154127MaRDI QIDQ1787924
Zsolt Darvay, Petra-Renáta Takács
Publication date: 5 October 2018
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-018-0524-0
Nonconvex programming, global optimization (90C26) Linear programming (90C05) Interior-point methods (90C51)
Related Items
A step-truncated method in a wide neighborhood interior-point algorithm for linear programming ⋮ A wide neighbourhood primal-dual second-order corrector interior point algorithm for semidefinite optimization ⋮ A new long-step interior point algorithm for linear programming based on the algebraic equivalent transformation ⋮ A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization ⋮ Editorial. CEJOR special issue of Croatian Operational Research Society ⋮ Editorial ⋮ A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
- An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization
- An \(O(\sqrt nL)\) iteration primal-dual second-order corrector algorithm for linear programming
- A new polynomial-time algorithm for linear programming
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
- A polynomial path-following interior point algorithm for general linear complementarity problems
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
- EP theorem for dual linear complementarity problems
- A unified approach to interior point algorithms for linear complementary problems
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Parallel search paths for the simplex algorithm
- The Mizuno-Todd-Ye algorithm in a larger neighborhood of the central path
- A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
- Primal-dual target-following algorithms for linear programming
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- A new \(O(\sqrt{n}L)\)-iteration predictor-corrector algorithm with wide neighborhood for semidefinite programming
- A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
- An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
- 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
- Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
- Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
