Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
From MaRDI portal
Publication:2076907
DOI10.1016/j.ejor.2021.08.039zbMath1490.90286OpenAlexW3138631655MaRDI QIDQ2076907
Petra Renáta Rigó, Zsolt Darvay, Tibor Illés
Publication date: 22 February 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.08.039
interior-point methodspredictor-corrector algorithm\(P_*(\kappa)\)-linear complementarity problempolynomial iteration complexity
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
Interior-point algorithm for linear programming based on a new descent direction ⋮ Corrector-predictor interior-point method with new search direction for semidefinite optimization
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial interior-point algorithm for monotone linear complementarity problems
- A full-Newton step interior-point algorithm based on modified Newton direction
- On the complexity of computing the handicap of a sufficient matrix
- New method for determining search directions for interior-point algorithms in linear optimization
- 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
- Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
- A polynomial path-following interior point algorithm for general linear complementarity problems
- EP theorem for dual linear complementarity problems
- NP-completeness of the linear complementarity problem
- Sufficient matrices and the linear complementarity problem
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- On the complexity of following the central path of linear programs by linear extrapolation. II
- The linear complementarity problem, sufficient matrices, and the criss- cross method
- On the interplay among entropy, variable metrics and potential functions in interior-point algorithms
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Criss-cross methods: A fresh view on pivot algorithms
- EP theorems and linear complementarity problems
- Interior-point methods
- 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
- Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- \(P_ *\)-matrices are just sufficient
- A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function
- 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
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- A path to the Arrow-Debreu competitive market equilibrium
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
- An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
- An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones
- On the number of solutions to a class of linear complementarity problems
- Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
- The Simplex Method for Quadratic Programming
- On the Implementation of a Primal-Dual Interior Point Method
- A complementary variant of Lemke's method for the linear complementary problem
- 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
- New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function
- 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
- Quitting Games and Linear Complementarity Problems
- The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems
- Adaptive full newton-step infeasible interior-point method for sufficient horizontal LCP
- Primal-dual entropy-based interior-point algorithms for linear optimization
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- Equilibrium Points of Bimatrix Games
- New criss-cross type algorithms for linear complementarity problems with sufficient matrices
- Simplicial methods for quadratic programming
- The Symmetric Formulation of the Simplex Method for Quadratic Programming
- 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: Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
