Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term

DOI10.1007/978-1-4614-5134-1_24zbMath1375.90314OpenAlexW116013729MaRDI QIDQ4596180

M. El Ghami

Publication date: 30 November 2017

Published in: Optimization Theory, Decision Making, and Operations Research Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4614-5134-1_24

zbMATH Keywords

primal-dual methodkernel functioninterior-pointlinear complementary problemlarge updatesmall update

Mathematics Subject Classification ID

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

Related Items (9)

A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem ⋮ An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function ⋮ An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function ⋮ A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions ⋮ Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term ⋮ An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term ⋮ A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions ⋮ An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function ⋮ An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
• 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 complementarity problems: A summary
• 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 Primal-Dual Algorithms forP_*(κ) Linear Complementarity Problems
• 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
• Interior Point Methods for Linear Optimization

This page was built for publication: Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term