Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
From MaRDI portal
Publication:5312760
DOI10.1080/10556780512331318038zbMath1087.90078OpenAlexW2086055807MaRDI QIDQ5312760
Publication date: 25 August 2005
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780512331318038
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
Sufficient weighted complementarity problems ⋮ Trajectory-following methods for large-scale degenerate convex quadratic programming ⋮ Postponing the choice of the barrier parameter in Mehrotra-type predictor-corrector algorithms ⋮ Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems ⋮ On the complexity of computing the handicap of a sufficient matrix ⋮ A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP ⋮ A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems ⋮ Corrector-predictor methods for sufficient linear complementarity problems ⋮ Interior point algorithm for \(P_*\) nonlinear complementarity problems ⋮ A polynomial path-following interior point algorithm for general linear complementarity problems ⋮ Polynomial convergence of two higher order interior-point methods for \(P_*(\kappa)\)-LCP in a wide neighborhood of the central path ⋮ Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP ⋮ Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood ⋮ Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization ⋮ Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions ⋮ A Predictor–Corrector Algorithm for Monotone Linear Complementarity Problems in a Wide Neighborhood ⋮ On sufficient properties of sufficient matrices ⋮ Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction ⋮ Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique ⋮ A new second-order corrector interior-point algorithm for P*(k)-LCP
Cites Work
- Determining the handicap of a sufficient matrix
- Superlinearly convergent infeasible-interior-point algorithm for degenerate LCP
- A path following method for LCP with superlinearly convergent iteration sequence
- On quadratic and \(O(\sqrt{n}L)\) convergence of a predictor-corrector algorithm for LCP
- Local convergence of interior-point algorithms for degenerate monotone LCP
- On the rate of local convergence of high-order-infeasible-path-following algorithms for \(P_*\)-linear complementarity problems
- A superlinearly convergent predictor-corrector method for degenerate LCP in a wide neighborhood of the central path with \(O(\sqrt nL)\)-iteration complexity
- Predictor-corrector method for linear complementarity problems with polynomial complexity and superlinear convergence
- A superquadratic infeasible-interior-point method for linear complementarity problems
- A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming
- High Order Infeasible-Interior-Point Methods for Solving Sufficient Linear Complementarity Problems
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
- Equivaence between different formulations of the linear complementarity promblem
- Interior Point Algorithms For Linear Complementarity Problems Based On Large Neighborhoods Of The Central Path
- A New Infinity-Norm Path Following Algorithm for Linear Programming
- Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem
- A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition
- An Asymptotical $O(\sqrt{n} L)$-Iteration Path-Following Linear Programming Algorithm That Uses Wide Neighborhoods
- Complexity of Predictor-Corrector Algorithms for LCP Based on a Large Neighborhood of the Central Path
- High order long-step methods for solving linear complementarity problems
