Feasible short-step interior point algorithm for linear complementarity problem based on kernel function

zbMATH Open1413.90254MaRDI QIDQ4614853FDOQ4614853

Authors: El Amir Djeffal, Lakhdar Djeffal 

Publication date: 31 January 2019

Full work available at URL: https://camo.ici.ro/journal/vol15/v15b3.pdf

Recommendations

• An infeasible interior-point algorithm for linear complementarity problem based on a kernel function
• A full-Newton step infeasible interior-point algorithm for linear complementarity problems based on a kernel function
• A full-Newton step infeasible interior-point algorithm for LCPs based on a kernel function
• Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
• An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function

zbMATH Keywords

quadratic programminginterior point methodsconvex nonlinear programming

Mathematics Subject Classification ID

Nonlinear programming (90C30) Interior-point methods (90C51)

Cited In (3)

• Finding a strict feasible dual solution of a convex optimization problem
• Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
• A primal-dual interior-point method based on a new kernel function for linear complementarity problem

This page was built for publication: Feasible short-step interior point algorithm for linear complementarity problem based on kernel function

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