Large-update interior point algorithm for P_*-linear complementarity problem

DOI10.1186/1029-242X-2014-363MaRDI QIDQ257756zbMATH OpenOpenAlexWikidataFDO

Authors Gyeong-Mi Cho

Publication date 17 March 2016

Published in Journal of Inequalities and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1186/1029-242x-2014-363

zbMATH Keywords

complexitybarrier functioninterior point methodlinear complementarity problem

Mathematics Subject Classification ID

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

Recommendations

• A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems
• Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems
• Complexity of a large-update interior-point algorithm for \(P_*(\kappa)\) linear complementarity problem
• Large-Step Interior Point Algorithms for Linear Complementarity Problems
• A class of new large-update primal-dual interior-point algorithms for \(P_\ast(\kappa)\) nonlinear complementarity problems
• A new and efficient large-update interior-point method for linear optimization
• A new predictor-corrector large-update interior-point algorithm for nonmonotone linear complementarity problems
• Interior point algorithm for \(P_*\) nonlinear complementarity problems
• Large-update primal-dual interior-point algorithm for semidefinite optimization

Cites work

• 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 1862745 (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 generic primal-dual interior-point method for semidefinite optimization based on a new class of kernel functions
• 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 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 complementary 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
• Polynomial interior-point algorithms for P_*( ) horizontal linear complementarity problem
• Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
• 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

(9)

• Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function
• An efficient multi parametric kernel function for large and small-update methods interior point algorithm for P_*(κ)-horizontal linear complementarity problem
• Complexity of a large-update interior-point algorithm for \(P_*(\kappa)\) linear complementarity problem
• A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
• A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions
• A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
• Complexity analysis of a weighted-full-Newton step interior-point algorithm for \(P_*(\kappa)\)-LCP
• An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term
• A large-update interior point algorithm for \(P_*(\kappa)\) LCP based on a new kernel function

This page was built for publication: Large-update interior point algorithm for \(P_*\)-linear complementarity problem

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