Interior-point algorithm based on general kernel function for monotone linear complementarity problem
From MaRDI portal
Publication:3572642
DOI10.1007/s11741-009-0201-3zbMath1212.90389OpenAlexW1573443533MaRDI QIDQ3572642
Publication date: 8 July 2010
Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11741-009-0201-3
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (2)
An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function ⋮ A generic kernel function for interior point methods
Cites Work
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- On homogeneous and self-dual algorithms for LCP
- Self-regular functions and new search directions for linear and semidefinite optimization
- Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
- A class of polynomially solvable linear complementarity problems
- On a Wide Region of Centers and Primal-Dual Interior Point Algorithms for Linear Programming
- A primal‐dual interior-point method for linear optimization based on a new proximity function
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- An O$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP
This page was built for publication: Interior-point algorithm based on general kernel function for monotone linear complementarity problem
