A primal-dual large-update interior-point algorithm for P_*()-LCP based on a new class of kernel functions

DOI10.1007/S10255-018-0729-YMaRDI QIDQ1709428zbMATH OpenOpenAlexFDO

Authors Ping Ji, Mingwang Zhang, Xin Li

Publication date 5 April 2018

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10255-018-0729-y

zbMATH Keywords

complexitylinear complementarity problemkernel functioninterior-point method

Mathematics Subject Classification ID

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

Recommendations

• Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
• A large-update interior point algorithm for \(P_*(\kappa)\) LCP based on a new kernel function
• New primal-dual interior point methods for \(P_*(\kappa)\) linear complementarity problems
• A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
• A new class of polynomial interior-point algorithm for \(P_* (\kappa)\) linear complementarity problems

Cites work

• scientific article; zbMATH DE number 4147426 (Why is no real title available?)
• scientific article; zbMATH DE number 53115 (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?)
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
• A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
• A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
• A new class of polynomial interior-point algorithms for \(P_*(\kappa)\)-linear complementary problems
• A new class of polynomial primal-dual methods for linear and semidefinite optimization
• 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 primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems
• Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
• Full Nesterov-Todd step feasible interior-point method for the Cartesian \(P_{\ast}(\kappa)\)-SCLCP
• Interior-point methods for Cartesian \(P_{\ast}(\kappa)\)-linear complementarity problems over symmetric cones based on the eligible kernel functions
• Polynomial interior-point algorithms for P_*( ) horizontal linear complementarity problem
• Self-regular functions and new search directions for linear and semidefinite optimization
• Unified analysis of kernel-based interior-point methods for \(P_*(\kappa)\)-linear complementarity problems

Cited in

(18)

• A class of new large-update primal-dual interior-point algorithms for \(P_\ast(\kappa)\) nonlinear complementarity problems
• Interior point algorithm for \(P_*\) nonlinear complementarity problems
• NEW COMPLEXITY ANALYSIS OF PRIMAL-DUAL IMPS FOR P_*LAPS BASED ON LARGE UPDATES
• Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
• A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
• Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
• 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
• Kernel-function based primal-dual algorithms for \(P_* (\kappa )\) linear complementarity problems
• 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
• An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming
• New path-following interior-point algorithms for \(P_{\ast}(\kappa)\)-nonlinear complementarity problems
• An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term
• New primal-dual interior point methods for \(P_*(\kappa)\) linear complementarity problems
• A large-update interior point algorithm for \(P_*(\kappa)\) LCP based on a new kernel function
• The effect of the step-size on the numerical behavior of a primal-dual interior-point algorithm applied to \(P_*(\kappa)\)-linear complementary problem
• A new class of polynomial interior-point algorithm for \(P_* (\kappa)\) linear complementarity problems

This page was built for publication: A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions

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