Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
From MaRDI portal
Publication:6491339
DOI10.1016/J.EJCO.2023.100072MaRDI QIDQ6491339
Tibor Illés, Petra Renáta Rigó, Roland Török
Publication date: 24 April 2024
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
wide neighbourhoodpredictor-corrector interior-point algorithmalgebraic equivalent transformation technique\(P_\ast(\kappa)\)-linear complementarity problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Corrector-predictor methods for sufficient linear complementarity problems
- On the complexity of computing the handicap of a sufficient matrix
- Determining the handicap of a sufficient matrix
- Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization
- A polynomial path-following interior point algorithm for general linear complementarity problems
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- EP theorem for dual linear complementarity problems
- NP-completeness of the linear complementarity problem
- Sufficient matrices and the linear complementarity problem
- A polynomial-time algorithm for a class of linear complementarity problems
- On the complexity of following the central path of linear programs by linear extrapolation. II
- 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
- Polynomial primal-dual affine scaling algorithms in semidefinite programming
- Extension of primal-dual interior point algorithms to symmetric cones
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- A generalized direction in interior point method for monotone 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
- On a subclass of \(P_ 0\)
- \(P_ *\)-matrices are just sufficient
- A corrector-predictor interior-point method with new search direction for linear optimization
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- Market exchange models and geometric programming
- A new infeasible interior-point method based on Darvay's technique for symmetric optimization
- A path to the Arrow-Debreu competitive market equilibrium
- Some generalizations of positive definiteness and monotonicity
- A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems
- Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-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
- Engineering and Economic Applications of Complementarity Problems
- A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction
- Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity
- Quitting Games and Linear Complementarity Problems
- 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
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
- Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
- Copositivity tests based on the linear complementarity problem
This page was built for publication: Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
