Large-update interior point algorithm for \(P_*\)-linear complementarity problem
From MaRDI portal
Publication:257756
DOI10.1186/1029-242X-2014-363zbMath1332.90298OpenAlexW2100364159WikidataQ59320671 ScholiaQ59320671MaRDI QIDQ257756
Publication date: 17 March 2016
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/1029-242x-2014-363
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items (3)
An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term ⋮ Complexity analysis of a weighted-full-Newton step interior-point algorithm forP∗(κ)-LCP ⋮ A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
- A unified approach to interior point algorithms for linear complementary problems
- Self-regular functions and new search directions for linear and semidefinite optimization
- 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 new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
- A generic primal–dual interior-point method for semidefinite optimization based on a new class of kernel functions
- 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
- Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
- Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP
This page was built for publication: Large-update interior point algorithm for \(P_*\)-linear complementarity problem
