Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term
From MaRDI portal
Publication:1730836
DOI10.1007/s10957-018-1344-zzbMath1409.90199OpenAlexW2883514251MaRDI QIDQ1730836
Publication date: 6 March 2019
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-018-1344-z
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (2)
Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term ⋮ An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization
Cites Work
- 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 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 polynomial-time algorithm for linear programming
- A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
- Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric 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
- Finite-Dimensional Variational Inequalities and Complementarity Problems
This page was built for publication: Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term
