A new class of polynomial interior-point algorithms for P_*()-linear complementary problems
From MaRDI portal
Publication:5453751
zbMATH Open1161.90507MaRDI QIDQ5453751FDOQ5453751
Authors: Goran Lesaja, C. Roos, Yanqin Bai
Publication date: 3 April 2008
Recommendations
- A new class of polynomial interior-point algorithm for \(P_* (\kappa)\) linear complementarity problems
- Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
- A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions
Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cited In (29)
- Large-update interior point algorithm for \(P_*\)-linear complementarity problem
- An \(\mathcal{O}\sqrt{n}L)\) predictor-corrector interior-point algorithm for semidefinite optimization based on a wide neighbourhood
- Title not available (Why is that?)
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term
- Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- An interior-point algorithm for \(P_{ast}(kappa)\)-linear complementarity problem based on a new trigonometric kernel function
- A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem
- A path-following full Newton-step infeasible interior-point algorithm for \(P_*(\kappa)\)-HLCPs based on a kernel function
- Unified approach of interior-point algorithms for \(P_* (\kappa)\)-LCPs using a new class of algebraically equivalent transformations
- An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
- Unified analysis of kernel-based interior-point methods for \(P_*(\kappa)\)-linear complementarity problems
- An improved predictor-corrector interior-point algorithm for linear complementarity problems with \(O(\sqrt{n}L)\)-iteration complexity
- A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions
- A polynomial path-following interior point algorithm for general linear complementarity problems
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods
- An adaptive infeasible interior-point algorithm for linear complementarity problems
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
- A predictor-corrector algorithm for monotone linear complementarity problems in a wide neighborhood
- The accuracy of interior-point methods based on kernel functions
- A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function
- A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
- A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems
- A full-Newton step interior-point algorithm for linear optimization based on a finite barrier
- An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term
- A new polynomial interior-point algorithm for the Cartesian \(P_\ast(\kappa)\) second-order cone linear complementarity problem
- A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem
- A new class of polynomial interior-point algorithm for \(P_* (\kappa)\) linear complementarity problems
This page was built for publication: A new class of polynomial interior-point algorithms for \(P_*(\kappa)\)-linear complementary problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5453751)