An interior-point algorithm for P_*()-LCP based on a new trigonometric kernel function with a double barrier term

DOI10.1007/S12190-015-0978-3MaRDI QIDQ513522zbMATH OpenOpenAlexFDO

Authors Yan Chen, Xin Li, Mingwang Zhang

Publication date 7 March 2017

Published in Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s12190-015-0978-3

zbMATH Keywords

linear complementarity problemiteration complexitykernel functioninterior-point algorithmlarge-update

Mathematics Subject Classification ID

Interior-point methods (90C51) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Recommendations

• An interior-point algorithm for \(P_{ast}(kappa)\)-linear complementarity problem based on a new trigonometric kernel function
• An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
• Primal-dual algorithms for \(P_\ast(\kappa)\) linear complementarity problems based on kernel-function with trigonometric barrier term
• Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
• A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions

Cites work

• scientific article; zbMATH DE number 53115 (Why is no real title available?)
• scientific article; zbMATH DE number 1862745 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
• A full-Newton step infeasible interior-point algorithm for P_ () linear complementarity problem
• 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
• A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
• A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
• A new primal-dual path-following interior-point algorithm for semidefinite optimization
• A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
• Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term
• Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
• Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
• Engineering and Economic Applications of Complementarity Problems
• Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
• Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
• Large-update interior point algorithm for P_*-linear complementarity problem
• New complexity analysis of a full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-LCP
• Polynomial interior-point algorithms for P_*( ) horizontal linear complementarity problem
• Primal-dual algorithms for \(P_\ast(\kappa)\) linear complementarity problems based on kernel-function with trigonometric barrier term
• Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
• Self-regular functions and new search directions for linear and semidefinite optimization

Cited in

(10)

• An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization
• Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term
• An interior-point algorithm for \(P_{ast}(kappa)\)-linear complementarity problem based on a new trigonometric kernel function
• An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function
• A new parametric kernel function with a trigonometric barrier term for \(P_*(\kappa)\)-linear complementarity problems
• A generic kernel function for interior point methods
• Primal-dual algorithms for \(P_\ast(\kappa)\) linear complementarity problems based on kernel-function with trigonometric barrier term
• An infeasible interior-point method for the \(P_*\)-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step
• A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
• Primal-dual interior-point method for linear optimization based on a kernel function with trigonometric growth term

This page was built for publication: An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q513522)