A kernel function based interior-point methods for solving P_*( )-linear complementarity problem
From MaRDI portal
Publication:606335
Recommendations
- Based on a class of kernel functions interior-point algorithms for P_*()-horizontal linear complementarity problems
- A new class of polynomial interior-point algorithm for P_* () linear complementarity problems
- Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
- A new class of polynomial interior-point algorithms for P_*()-linear complementary problems
- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
Cites work
- \(P_ *\)-matrices are just sufficient
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A new class of polynomial interior-point algorithms for P_*()-linear complementary problems
- A new class of polynomial primal-dual methods for linear and semidefinite optimization
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm for linear optimization based on a new simple kernel function
- A self-adjusting interior point algorithm for linear complementarity problems
- A superquadratic infeasible-interior-point method for linear complementarity problems
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP
- An interior point method for linear programming based on a class of Kernel functions
- An interior-point algorithm for linear optimization based on a new kernel function
- Engineering and Economic Applications of Complementarity Problems
- 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
Cited in
(24)- Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
- Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term
- Complementarity properties of the Lyapunov transformation over symmetric cones
- An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
- An interior-point method for P_*()-linear complementarity problem based on a trigonometric kernel function
- Kernel-based interior-point methods for Cartesian P_*()-linear complementarity problems over symmetric cones
- A new class of polynomial interior-point algorithm for P_* () linear complementarity problems
- Based on a class of kernel functions interior-point algorithms for P_*()-horizontal linear complementarity problems
- Kernel-function based primal-dual algorithms for P_* ( ) linear complementarity problems
- Unified analysis of kernel-based interior-point methods for P_*()-linear complementarity problems
- Kernel function based interior-point methods for horizontal linear complementarity problems
- An interior-point algorithm for \(P_{ast}(kappa)\)-linear complementarity problem based on a new trigonometric kernel function
- New interior-point methods for P_()-nonlinear complementarity problems
- An interior point approach for linear complementarity problem using new parametrized kernel function
- An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function
- An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term
- A new class of polynomial interior-point algorithms for P_*()-linear complementary problems
- Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions
- A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function
- Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function
- An interior-point algorithm for LCP based on a parameterized hyperbolic kernel function
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
This page was built for publication: A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q606335)
