A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem
DOI10.1007/s11424-014-1273-3zbMath1326.90091OpenAlexW2053561689MaRDI QIDQ890633
Publication date: 10 November 2015
Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11424-014-1273-3
polynomial complexityinfeasible interior-point method\(P_\ast (\kappa)\) linear complementarity problemsfull-Newton steps
Numerical mathematical programming methods (65K05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
- A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
- A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
- A unified approach to interior point algorithms for linear complementary problems
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Self-regular functions and new search directions for linear and semidefinite optimization
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- SimplifiedO(nL) infeasible interior-point algorithm for linear optimization using full-Newton steps
- A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
- Interior Point Methods for Linear Optimization
This page was built for publication: A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem