Kernel-function Based Primal-Dual Algorithms forP*(κ) Linear Complementarity Problems

DOI10.1051/ro/2010014zbMath1206.90191OpenAlexW2116883906MaRDI QIDQ3057529

Trond Steihaug, M. El Ghami

Publication date: 24 November 2010

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

Full work available at URL: https://eudml.org/doc/44717

zbMATH Keywords

interior-pointcentral pathslarge updatesmall update

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term ⋮ A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
• Interior path following primal-dual algorithms. I: Linear programming
• A unified approach to interior point algorithms for linear complementary problems
• Log-barrier method for two-stage quadratic stochastic programming
• Self-regular functions and new search directions for linear and semidefinite optimization
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
• Kernel-function Based Algorithms for Semidefinite Optimization
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization