Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path
From MaRDI portal
Publication:722338
DOI10.1007/s10998-017-0231-yzbMath1413.90310OpenAlexW2773596707MaRDI QIDQ722338
Maryam Chitsaz, Behrouz Kheirfam
Publication date: 23 July 2018
Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10998-017-0231-y
linear complementarity probleminterior-point methodspolynomial complexitysuperlinear convergencewide neighborhoodcorrector-predictor methods
Related Items
A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP ⋮ A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood ⋮ A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization ⋮ A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood
Cites Work
- Unnamed Item
- Unnamed Item
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- On the complexity of computing the handicap of a sufficient matrix
- Determining the handicap of a sufficient matrix
- 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
- EP theorem for dual linear complementarity problems
- NP-completeness of the linear complementarity problem
- Sufficient matrices and the linear complementarity problem
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- EP theorems and linear complementarity problems
- A penalized Fischer-Burmeister NCP-function
- On a subclass of \(P_ 0\)
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
- High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems
- A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming
- 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
- A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems
- On a Class of Superlinearly Convergent Polynomial Time Interior Point Methods for Sufficient LCP
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
- The complexity of high-order predictor-corrector methods for solving sufficient 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
- Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
