An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
From MaRDI portal
Publication:4606373
DOI10.22124/jmm.2017.2537zbMath1384.65034OpenAlexW2791765808MaRDI QIDQ4606373
M. Reza Peyghami, Sajad Fathi-Hafshejani, Hossein Mansouri
Publication date: 7 March 2018
Full work available at URL: http://jmm.guilan.ac.ir/article_2537_cf3ea063a8ab351a654ae8a859b24f8d.pdf
complexityalgorithmlinear complementarity problemkernel functionprimal-dual interior point methodsnumerical resultlarge-update methods
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51) Complexity and performance of numerical algorithms (65Y20)
Related Items (4)
An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function ⋮ Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term ⋮ Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function
- An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term
- A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
- A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
- Interior-point algorithm for linear optimization based on a new trigonometric kernel function
- A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
- \(P_ *\)-matrices are just sufficient
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
- A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds
- Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
- Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems
- A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
- A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function
- Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
- Computational complexity of LCPs associated with positive definite symmetric matrices
- An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
- A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term
This page was built for publication: An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
