Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
type: Item
instance of: scholarly article
title: Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
zbMATH Open document ID: 1490.90286
author: Zsolt Darvay
author: Tibor Illés
author: Petra Renáta Rigó
published in: European Journal of Operational Research
publication date: 2022-02-22T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 7478879
zbMATH Keywords: interior-point methods
zbMATH Keywords: \(P_*(\kappa)\)-linear complementarity problem
zbMATH Keywords: predictor-corrector algorithm
zbMATH Keywords: polynomial iteration complexity
MaRDI profile type: Publication
full work available at URL: j.ejor.2021.08.039
OpenAlex ID: W3138631655
cites work: Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
cites work: Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
cites work: An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones
cites work: An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
cites work: Copositivity tests based on the linear complementarity problem
cites work: NP-completeness of the linear complementarity problem
cites work: Q4003375
cites work: Sufficient matrices and the linear complementarity problem
cites work: Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied
cites work: New criss-cross type algorithms for linear complementarity problems with sufficient matrices
cites work: The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems
cites work: Q3415802
cites work: Q3428838
cites work: A corrector-predictor interior-point method with new search direction for linear optimization
cites work: Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
cites work: Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction
cites work: Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
cites work: New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function
cites work: New method for determining search directions for interior-point algorithms in linear optimization
cites work: On the complexity of computing the handicap of a sufficient matrix
cites work: The linear complementarity problem, sufficient matrices, and the criss- cross method
cites work: Engineering and Economic Applications of Complementarity Problems
cites work: EP theorems and linear complementarity problems
cites work: Criss-cross methods: A fresh view on pivot algorithms
cites work: A generalized direction in interior point method for monotone linear complementarity problems
cites work: A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
cites work: EP theorem for dual linear complementarity problems
cites work: Polynomial interior point algorithms for general linear complementarity problems
cites work: A polynomial path-following interior point algorithm for general linear complementarity problems
cites work: Primal-dual entropy-based interior-point algorithms for linear optimization
cites work: A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
cites work: Q4577944
cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary
cites work: On the number of solutions to a class of linear complementarity problems
cites work: Q5608986
cites work: Equilibrium Points of Bimatrix Games
cites work: Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
cites work: Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP
cites work: Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
cites work: A polynomial interior-point algorithm for monotone linear complementarity problems
cites work: On the Implementation of a Primal-Dual Interior Point Method
cites work: A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
cites work: Q4791754
cites work: Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
cites work: Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
cites work: Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
cites work: A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
cites work: Interior-point methods
cites work: Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
cites work: Quitting Games and Linear Complementarity Problems
cites work: On the complexity of following the central path of linear programs by linear extrapolation. II
cites work: A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
cites work: On the interplay among entropy, variable metrics and potential functions in interior-point algorithms
cites work: \(P_ *\)-matrices are just sufficient
cites work: A complementary variant of Lemke's method for the linear complementary problem
cites work: Simplicial methods for quadratic programming
cites work: The Symmetric Formulation of the Simplex Method for Quadratic Programming
cites work: The Simplex Method for Quadratic Programming
cites work: A path to the Arrow-Debreu competitive market equilibrium

Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique (cites work)
cites work: A full-Newton step interior-point algorithm based on modified Newton direction

Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique (cites work)
cites work: A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function

Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique (DOI)
DOI: 10.1016/J.EJOR.2021.08.039