Unified approach of interior-point algorithms for \(P_* (\kappa)\)-LCPs using a new class of algebraically equivalent transformations
From MaRDI portal
Publication:6596327
DOI10.1007/s10957-023-02232-1MaRDI QIDQ6596327
Roland Török, Tibor Illés, Petra Renáta Rigó
Publication date: 2 September 2024
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
interior-point algorithmnew class of AET functionsalgebraic equivalent transformation technique\(P_* (\kappa)\)-linear complementarity problems
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial interior-point algorithm for monotone linear complementarity problems
- On the complexity of computing 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 polynomial path-following interior point algorithm for general 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
- A unified approach to interior point algorithms for linear complementary problems
- 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
- On a subclass of \(P_ 0\)
- \(P_ *\)-matrices are just sufficient
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- A path to the Arrow-Debreu competitive market equilibrium
- An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation
- 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
- Engineering and Economic Applications of Complementarity Problems
- 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
- Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function
- Quitting Games and Linear Complementarity Problems
- Equilibrium Points of Bimatrix Games
Related Items (1)
This page was built for publication: Unified approach of interior-point algorithms for \(P_* (\kappa)\)-LCPs using a new class of algebraically equivalent transformations