An interior-point algorithm for P_ast(kappa)-linear complementarity problem based on a new trigonometric kernel function
DOI10.22124/JMM.2017.2537zbMATH Open1384.65034OpenAlexW2791765808MaRDI QIDQ4606373FDOQ4606373
Authors: Sajad Fathi-Hafshejani, Hossein Mansouri, M. Reza Peyghami
Publication date: 7 March 2018
Full work available at URL: http://jmm.guilan.ac.ir/article_2537_cf3ea063a8ab351a654ae8a859b24f8d.pdf
Recommendations
- An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term
- An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
- Primal-dual algorithms for \(P_\ast(\kappa)\) linear complementarity problems based on kernel-function with trigonometric barrier term
- Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
- An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function
algorithmcomplexitynumerical resultlinear complementarity problemkernel functionprimal-dual interior point methodslarge-update methods
Numerical mathematical programming methods (65K05) Complexity and performance of numerical algorithms (65Y20) Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- \(P_ *\)-matrices are just sufficient
- 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
- Unified analysis of kernel-based interior-point methods for \(P_*(\kappa)\)-linear complementarity problems
- Title not available (Why is that?)
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Title not available (Why is that?)
- A new class of polynomial interior-point algorithms for \(P_*(\kappa)\)-linear complementary problems
- A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
- Title not available (Why is that?)
- Computational complexity of LCPs associated with positive definite symmetric matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- 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 polynomial-time algorithm for linear 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
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
- Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
- A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function
- An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric 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
- A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
- A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
- A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function
- An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New 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
Cited In (14)
- An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization
- Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term
- An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function
- A new parametric kernel function with a trigonometric barrier term for \(P_*(\kappa)\)-linear complementarity problems
- Primal-dual algorithms for \(P_\ast(\kappa)\) linear complementarity problems based on kernel-function with trigonometric barrier term
- A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function
- An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
- A new interior-point algorithm for \(P_{\ast}(k)\)-NCP based on a class of parametric kernel functions
- An infeasible interior-point method for the \(P_*\)-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
- An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function
- A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions
- Interior-point algorithm for linear optimization based on a new trigonometric kernel function
- 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
This page was built for publication: An interior-point algorithm for \(P_{ast}(kappa)\)-linear complementarity problem based on a new trigonometric kernel function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606373)