Interior point algorithm for \(P_*\) nonlinear complementarity problems
From MaRDI portal
Publication:544204
DOI10.1016/j.cam.2011.01.021zbMath1225.65065MaRDI QIDQ544204
Publication date: 14 June 2011
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2011.01.021
complexity; kernel function; nonlinear complementarity problem; polynomial algorithm; large-update primal-dual interior point method
65K05: Numerical mathematical programming methods
90C33: Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming)
90C51: Interior-point methods
65Y20: Complexity and performance of numerical algorithms
Related Items
A new interior-point algorithm for \(P_{\ast}(k)\)-NCP based on a class of parametric kernel functions, Using vector divisions in solving the linear complementarity problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new path-following algorithm for nonlinear \(P_*\) complementarity problems
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
- Strict feasibility conditions in nonlinear complementarity problems
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems
- Homotopy Continuation Methods for Nonlinear Complementarity Problems
- Engineering and Economic Applications of Complementarity Problems
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path
- A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
