Unified analysis of kernel-based interior-point methods for P_*()-linear complementarity problems
From MaRDI portal
Publication:3083319
Recommendations
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
- A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem
- A new class of polynomial interior-point algorithms for \(P_*(\kappa)\)-linear complementary problems
- Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
- Based on a class of kernel functions interior-point algorithms for \(P_*(\kappa)\)-horizontal linear complementarity problems
Cited in
(37)- A long-step interior-point algorithm for symmetric cone Cartesian \(P_\ast (\kappa)\)-HLCP
- Kernel function based interior-point methods for horizontal linear complementarity problems
- A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function
- Large-update interior point algorithm for P_*-linear complementarity problem
- 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
- An interior-point algorithm for \(P_{ast}(kappa)\)-linear complementarity problem based on a new trigonometric kernel function
- A generic kernel function for interior point methods
- scientific article; zbMATH DE number 6913928 (Why is no real title available?)
- A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function
- New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
- Kernel-based full-Newton step feasible interior-point algorithm for \(P_* (\kappa)\)-weighted linear complementarity problem
- Sufficient matrices: properties, generating and testing
- Unified approach of interior-point algorithms for \(P_* (\kappa)\)-LCPs using a new class of algebraically equivalent transformations
- A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions
- An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
- A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions
- Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique
- A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
- A corrector-predictor interior-point method with new search direction for linear optimization
- Large-step interior-point algorithm for linear optimization based on a new wide neighbourhood
- The accuracy of interior-point methods based on kernel functions
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function
- A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function
- A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function
- A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions
- A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
- Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation
- A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
- On complexity of a new Mehrotra-type 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 long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization
- Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions
- Interior-point methods for Cartesian \(P_{\ast}(\kappa)\)-linear complementarity problems over symmetric cones based on the eligible kernel functions
This page was built for publication: Unified analysis of kernel-based interior-point methods for \(P_*(\kappa)\)-linear complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3083319)
