A new interior-point algorithm for \(P_{\ast}(k)\)-NCP based on a class of parametric kernel functions

DOI10.1016/j.orl.2016.04.009zbMath1380.90262OpenAlexW2345275033MaRDI QIDQ1694775

Xin Li

Publication date: 6 February 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2016.04.009

zbMATH Keywords

kernel functionnonlinear complementarity probleminterior point methodsiteration complexity

Mathematics Subject Classification ID

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

Related Items (1)

An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function

Cites Work

• Unnamed Item
• Unnamed Item
• A class of new large-update primal-dual interior-point algorithms for \(P_\ast(\kappa)\) nonlinear complementarity problems
• Interior point algorithm for \(P_*\) nonlinear complementarity problems
• New parameterized kernel functions for linear optimization
• An interior proximal point algorithm for nonlinear complementarity problems
• A new logarithmic-quadratic proximal method for nonlinear complementarity problems
• Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems
• A new one-step smoothing Newton method for nonlinear complementarity problem with \(P_{0}\)-function
• A variant smoothing Newton method for \(P_0\)-\(NCP\) based on a new smoothing function
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Two interior-point methods for nonlinear \(P_*(\tau)\)-complementarity problems.
• Strict feasibility conditions in nonlinear complementarity problems
• Self-regular functions and new search directions for linear and semidefinite optimization
• New path-following interior-point algorithms for \(P_{\ast}(\kappa)\)-nonlinear complementarity problems
• Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization

This page was built for publication: A new interior-point algorithm for \(P_{\ast}(k)\)-NCP based on a class of parametric kernel functions