An interior point method for P_*()-horizontal linear complementarity problem based on a new proximity function
DOI10.1007/S12190-019-01284-9zbMATH Open1475.90109OpenAlexW2972976082MaRDI QIDQ2053282FDOQ2053282
Authors: Yanyan Li 
Publication date: 29 November 2021
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-019-01284-9
Recommendations
- Kernel function based interior-point methods for horizontal linear complementarity problems
- Based on a class of kernel functions interior-point algorithms for \(P_*(\kappa)\)-horizontal linear complementarity problems
- An interior-point algorithm for \(P_{ast}(kappa)\)-linear complementarity problem based on a new trigonometric kernel function
- A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem
- Interior-point methods for \(P_\ast(\kappa)\)-horizontal linear complementarity problems
primal-dual interior point methodslarge-update methodstrigonometric kernel functionhorizontal linear complementarity problems
Numerical mathematical programming methods (65K05) Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Unified analysis of kernel-based interior-point methods for \(P_*(\kappa)\)-linear complementarity problems
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Title not available (Why is that?)
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function
- Title not available (Why is that?)
- A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
- Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
- A new search direction for full-Newton step interior-point method in \(P_*(\kappa)\)-HLCP
- 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
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
- Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
- Kernel function based interior-point methods for horizontal linear complementarity problems
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions
- 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
- A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem
Cited In (9)
- Kernel function based interior-point methods for horizontal linear complementarity problems
- An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization
- An interior-point algorithm for \(P_{ast}(kappa)\)-linear complementarity problem based on a new trigonometric kernel function
- A primal-dual interior-point method based on a new kernel function for linear complementarity problem
- Interior-point methods for \(P_\ast(\kappa)\)-horizontal linear complementarity problems
- A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function
- A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions
- Title not available (Why is that?)
- Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions
This page was built for publication: An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2053282)
