An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step

DOI10.22049/cco.2018.25801.1038zbMath1398.90203OpenAlexW2785262007MaRDI QIDQ4635027

M. Haghighi, Behrouz Kheirfam

Publication date: 13 April 2018

Full work available at URL: http://comb-opt.azaruniv.ac.ir/article_13693_2409f47f2535c47bbf7f6f1c4e57f291.pdf

zbMATH Keywords

linear complementarity problemkernel functionpolynomial complexityfull-Newton stepinfeasible interiorpoint method

Mathematics Subject Classification ID

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

Related Items (1)

A wide neighborhood interior-point algorithm based on the trigonometric kernel function

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A full Nesterov-Todd step infeasible interior-point algorithm for symmetric optimization based on a specific kernel function
• A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems
• A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function
• Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
• A new polynomial-time algorithm for linear programming
• Feasibility issues in a primal-dual interior-point method for linear programming
• A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function
• A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems
• Refinements, generalizations, and applications of Jordan's inequality and related problems
• A unified approach to interior point algorithms for linear complementarity problems: A summary
• A primal-dual infeasible-interior-point algorithm for linear programming
• Polynomiality of infeasible-interior-point algorithms for linear programming
• Predictor-corrector algorithm for solving \(P_ *(\kappa)\)-matrix LCP from arbitrary positive starting points
• A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
• A quadratically convergent \(\text{O}((\kappa +1)\sqrt n L)\)-iteration algorithm for the \(P_ *(\kappa)\)-matrix linear complementarity problem
• An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
• On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP
• A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization

This page was built for publication: An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step