Complexity analysis of a weighted-full-Newton step interior-point algorithm forP∗(κ)-LCP

DOI10.1051/ro/2015020zbMath1333.90132OpenAlexW2239959958MaRDI QIDQ2798122

Mohamed Achache

Publication date: 1 April 2016

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2015020

zbMATH Keywords

linear complementarity problemsinterior-point methodspolynomial complexityweighted-path-following\(P_*(\kappa)\)-matrix

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51) Number-theoretic algorithms; complexity (11Y16)

Related Items (1)

A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions

Cites Work

• Large-update interior point algorithm for \(P_*\)-linear complementarity problem
• New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
• Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
• Primal-dual target-following algorithms for linear programming
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
• A full-Newton step feasible weighted primal-dual interior point algorithm for monotone LCP
• A Weighted-Path-Following Method for Monotone Horizontal Linear Complementarity Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity analysis of a weighted-full-Newton step interior-point algorithm forP_∗(κ)-LCP