A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function
From MaRDI portal
Publication:2053077
DOI10.1007/s12190-020-01356-1zbMath1475.90130OpenAlexW3024413612MaRDI QIDQ2053077
Kun Huang, Ming Wang Zhang, Mengmeng Li, Yanli Lv
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-020-01356-1
Related Items
Cites Work
- A full-Newton step interior-point algorithm based on modified Newton direction
- New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
- A new primal-dual path-following method for convex quadratic programming
- New method for determining search directions for interior-point algorithms in linear optimization
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- A new polynomial-time algorithm for linear programming
- A polynomial path-following interior point algorithm for general linear complementarity problems
- A new primal-dual path-following interior-point algorithm for semidefinite optimization
- EP theorem for dual linear complementarity problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- A polynomial method of approximate centers for linear programming
- Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
- Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
- A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions
- 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 full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
- Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
- A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
- Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
