Predictor-corrector interior-point algorithm for P_*()-linear complementarity problems based on a new type of algebraic equivalent transformation technique

DOI10.1016/J.EJOR.2021.08.039zbMATH Open1490.90286OpenAlexW3138631655MaRDI QIDQ2076907FDOQ2076907

Authors: Zsolt Darvay, Tibor Illés, Petra Renáta Rigó 

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

Recommendations

• Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
• A predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
• A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
• Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation

zbMATH Keywords

interior-point methodspredictor-corrector algorithm\(P_*(\kappa)\)-linear complementarity problempolynomial iteration complexity

Mathematics Subject Classification ID

Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• The Simplex Method for Quadratic Programming
• Simplicial methods for quadratic programming
• On the Implementation of a Primal-Dual Interior Point Method
• Interior-point methods
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• \(P_ *\)-matrices are just sufficient
• A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
• Unified analysis of kernel-based interior-point methods for \(P_*(\kappa)\)-linear complementarity problems
• Title not available (Why is that?)
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• Title not available (Why is that?)
• Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
• An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
• Engineering and Economic Applications of Complementarity Problems
• The linear complementarity problem, sufficient matrices, and the criss- cross method
• Equilibrium Points of Bimatrix Games
• Sufficient matrices and the linear complementarity problem
• On the complexity of following the central path of linear programs by linear extrapolation. II
• 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
• Polynomial interior point algorithms for general linear complementarity problems
• Corrector‐Predictor Methods for Sufficient Linear Complementarity Problems in a Wide Neighborhood of the Central Path
• On the complexity of computing the handicap of a sufficient matrix
• A polynomial path-following interior point algorithm for general linear complementarity problems
• A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function
• Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
• New interior point algorithms in linear programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• NP-completeness of the linear complementarity problem
• A polynomial interior-point algorithm for monotone linear complementarity problems
• Criss-cross methods: A fresh view on pivot algorithms
• A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
• Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
• A full-Newton step interior-point algorithm based on modified Newton direction
• Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
• EP theorems and linear complementarity problems
• The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems
• New criss-cross type algorithms for linear complementarity problems with sufficient matrices
• A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
• The Symmetric Formulation of the Simplex Method for Quadratic Programming
• On the interplay among entropy, variable metrics and potential functions in interior-point algorithms
• EP theorem for dual linear complementarity problems
• Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
• 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
• On the number of solutions to a class of linear complementarity problems
• A generalized direction in interior point method for monotone linear complementarity problems
• Primal-dual entropy-based interior-point algorithms for linear optimization
• Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier
• An infeasible full-NT step IPM for \(P_\ast(\kappa)\) horizontal linear complementarity problem over Cartesian product of symmetric cones
• Copositivity tests based on the linear complementarity problem
• Finiteness of the quadratic primal simplex method when \(\mathbf s\)-monotone index selection rules are applied
• A corrector-predictor interior-point method with new search direction for linear optimization
• Adaptive full Newton-step infeasible interior-point method for sufficient horizontal LCP
• Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
• Quitting games and linear complementarity problems
• A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
• A new predictor-collector algorithm for linear programming
• A complementary variant of Lemke's method for the linear complementary problem
• New interior-point algorithm for symmetric optimization based on a positive-asymptotic barrier function

Cited In (13)

• A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function
• Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
• Interior-point algorithm for linear programming based on a new descent direction
• Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations
• An efficient primal-dual interior point algorithm for convex quadratic semidefinite optimization
• Sufficient matrices: properties, generating and testing
• Unified approach of interior-point algorithms for \(P_* (\kappa)\)-LCPs using a new class of algebraically equivalent transformations
• A predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems
• Corrector-predictor interior-point method with new search direction for semidefinite optimization
• New algorithm for \(P_*(k)\)-matrix linear complementarity problem based on algebraic transformation
• Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
• Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
• A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2076907)