Polynomial convergence of two higher order interior-point methods for P_*()-LCP in a wide neighborhood of the central path
From MaRDI portal
Publication:722338
DOI10.1007/S10998-017-0231-YzbMATH Open1413.90310OpenAlexW2773596707MaRDI QIDQ722338FDOQ722338
Authors: 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
Recommendations
- Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity
- Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
- A new second-order corrector interior-point algorithm for \(P_\ast (\kappa)\)-LCP
- A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
interior-point methodslinear complementarity problempolynomial complexitysuperlinear convergencewide neighborhoodcorrector-predictor methods
Cites Work
- 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
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Title not available (Why is that?)
- The complexity of high-order predictor-corrector methods for solving sufficient linear complementarity problems
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- High order infeasible-interior-point methods for solving sufficient linear complementarity problems
- On a class of superlinearly convergent polynomial time interior point methods for sufficient LCP
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
- Sufficient matrices and the linear complementarity problem
- On a subclass of \(P_ 0\)
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
- Polynomial interior point algorithms for general linear complementarity problems
- Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity
- Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
- On the complexity of computing the handicap of a sufficient matrix
- A polynomial path-following interior point algorithm for general linear complementarity problems
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- A wide neighborhood infeasible-interior-point method with arc-search for linear programming
- A new class of large neighborhood path-following interior point algorithms for semidefinite optimization with \(O(\sqrt{n}\log\frac{\text{Tr}(X^0S^0)}{\varepsilon})\) iteration complexity
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- A penalized Fischer-Burmeister NCP-function
- A Family of Polynomial Affine Scaling Algorithms for Positive SemiDefinite Linear Complementarity Problems
- NP-completeness of the linear complementarity problem
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
- EP theorems and linear complementarity problems
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
- A new \(O(\sqrt nL)\) iteration large-update primal-dual interior-point method for second-order cone programming
- Determining the handicap of a sufficient matrix
- EP theorem for dual linear complementarity problems
Cited In (12)
- A new predictor-corrector infeasible interior-point algorithm for linear optimization in a wide neighborhood
- A wide neighborhood predictor-infeasible corrector interior-point algorithm for linear optimization
- Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
- A high-order Dikin-type algorithm for \(P_* (\kappa)\)-LCPs in a wide neighborhood of the central path
- High order long-step methods for solving linear complementarity problems
- Polynomial convergence of a predictor-corrector interior-point algorithm for LCP
- Interior point methods for sufficient horizontal LCP in a wide neighborhood of the central path with best known iteration complexity
- A new second-order corrector interior-point algorithm for \(P_\ast (\kappa)\)-LCP
- A new search direction for full-Newton step interior-point method in \(P_*(\kappa)\)-HLCP
- A second-order corrector infeasible interior-point method for semidefinite optimization based on a wide neighborhood
- A strongly polynomial rounding procedure yielding a maximally complementary solution for \(P_*(\kappa)\) linear complementarity problems
- An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems
This page was built for publication: Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q722338)
