A new parametric kernel function yielding the best known iteration bounds of interior-point methods for the Cartesian P_( )-SCLCP

MaRDI QIDQ5144448zbMATH OpenFDO

Authors

Publication date 16 January 2021

Full work available at URL http://www.yokohamapublishers.jp/online-p/PJO/vol13/pjov13n4p547.pdf

zbMATH Keywords

Cartesian \(P_\ast(\kappa)\)-propertyEuclidean Jordan algebrasinterior-point methodslarge-update methodlinear complementarity problempolynomial complexitysmall-update method

Mathematics Subject Classification ID

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

Recommendations

• A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
• A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem
• An interior point approach for linear complementarity problem using new parametrized kernel function
• A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm
• A new parametric kernel function with a trigonometric barrier term for P_*()-linear complementarity problems

Cited in

(8)

• An efficient parameterized logarithmic kernel function for semidefinite optimization
• A new parametric kernel function with trigonometric barrier term for convex quadratic symmetric cone optimization
• Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term
• 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
• An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming
• Closing the iteration gap in linear programming with a new kernel function
• An efficient 2-parameter hyperbolic kernel-function-based interior-point method for linear programming

This page was built for publication: A new parametric kernel function yielding the best known iteration bounds of interior-point methods for the Cartesian \(P_\ast( \kappa)\)-SCLCP

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