A new large-update interior point algorithm for P_*() LCPs based on kernel functions
From MaRDI portal
Publication:858773
The authors study linear complementarity problems where a novel large-update primal-dual interior point algorithm is presented. The article begins with a description of the necessary preliminaries and background (Sections 1 and 2). This is followed by a description of the new kernel function used in the algorithm and a series of relevant theorems. All properties of the algorithm are fully proven. The proposed kernel functions are neither logarithmic barrier nor self-regular. The paper concludes with a list of useful references.
Recommendations
- A large-update interior point algorithm for P_*() LCP based on a new kernel function
- A primal-dual large-update interior-point algorithm for P_*()-LCP based on a new class of kernel functions
- Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
- A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
- An efficient multi parametric kernel function for large and small-update methods interior point algorithm for P*(κ)-horizontal linear complementarity problem
- A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
- A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
- A new interior-point algorithm for \(P_{\ast}(k)\)-NCP based on a class of parametric kernel functions
- A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
Cites work
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A polynomial-time algorithm for a class of linear complementarity problems
- A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
- A unified approach to interior point algorithms for linear complementary problems
- An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 4126998 (Why is no real title available?)
- scientific article; zbMATH DE number 1017028 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Self-regular functions and new search directions for linear and semidefinite optimization
- The Mizuno-Todd-Ye predictor-corrector algorithm for sufficient matrix linear complementarity problem
Cited in
(22)- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
- A primal-dual large-update interior-point algorithm for P_*()-LCP based on a new class of kernel functions
- Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term
- A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions
- On complexity of a new Mehrotra-type interior point algorithm for \(P_\ast(\kappa )\) linear complementarity problems
- 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
- Large-update interior point algorithm for P_*-linear complementarity problem
- Kernel-function based primal-dual algorithms for P_* ( ) linear complementarity problems
- An interior-point algorithm based on general kernel function for monotone linear complementarity problem
- Kernel function based interior-point methods for horizontal linear complementarity problems
- On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
- scientific article; zbMATH DE number 562330 (Why is no real title available?)
- Primal-dual algorithms for P_() linear complementarity problems based on kernel-function with trigonometric barrier term
- An interior-point algorithm for \(P_{ast}(kappa)\)-linear complementarity problem based on a new trigonometric kernel function
- A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
- A Mehrotra type predictor-corrector interior-point method for \(P_\ast(\kappa)\)-HLCP
- An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term
- A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem
- An interior-point algorithm for LCP based on a parameterized hyperbolic kernel function
- Closing the iteration gap in linear programming with a new kernel function
- Comprehensive analysis of kernel-based interior-point methods for the P_*()-LCP
This page was built for publication: A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q858773)
