Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
type: Item
instance of: scholarly article
title: Interior-point algorithm for sufficient LCPs based on the technique of algebraically equivalent transformation
zbMATH Open document ID: 1466.90108
author: Zsolt Darvay
author: Tibor Illés
author: Csilla Majoros
published in: Optimization Letters
publication date: 2021-05-05T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 7343955
zbMATH Keywords: interior-point algorithm
zbMATH Keywords: sufficient linear complementarity problem
zbMATH Keywords: algebraic equivalent transformation
zbMATH Keywords: polynomial complexity
MaRDI profile type: Publication
full work available at URL: s11590-020-01612-0
OpenAlex ID: W3037197978
cites work: Q5309480
cites work: A new primal-dual path-following method for convex quadratic programming
cites work: Complexity analysis and numerical implementation of a short-step primal-dual algorithm for linear complementarity problems
cites work: Equivaence between different formulations of the linear complementarity promblem
cites work: Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
cites work: A new full-Newton step \(O(n)\) infeasible interior-point algorithm for \(P_\ast(\kappa)\)-horizontal linear complementarity problems
cites work: A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization
cites work: Q4003375
cites work: Sufficient matrices and the linear complementarity problem
cites work: New criss-cross type algorithms for linear complementarity problems with sufficient matrices
cites work: The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems
cites work: Q5309527
cites work: Q5309541
cites work: Q3415802
cites work: Complexity analysis of a full-{N}ewton step interior-point method for linear optimization
cites work: The linear complementarity problem, sufficient matrices, and the criss- cross method
cites work: On the complexity of computing the handicap of a sufficient matrix
cites work: Q5340130
cites work: Some generalizations of positive definiteness and monotonicity
cites work: EP theorems and linear complementarity problems
cites work: Criss-cross methods: A fresh view on pivot algorithms
cites work: On a subclass of \(P_ 0\)
cites work: A strongly polynomial rounding procedure yielding a maximally complementary solution for \(P_*(\kappa)\) linear complementarity problems
cites work: Q4362984
cites work: A polynomial path-following interior point algorithm for general linear complementarity problems
cites work: A new infeasible interior-point method based on Darvay's technique for symmetric optimization
cites work: A predictor-corrector interior-point algorithm for \(P_\ast (\kappa )\)-horizontal linear complementarity problem
cites work: A unified approach to interior point algorithms for linear complementarity problems: A summary
cites work: On the Implementation of a Primal-Dual Interior Point Method
cites work: Q4206561
cites work: A path following interior-point method for linear complementarity problems over circular cones
cites work: Q4339096
cites work: Q3738934
cites work: \(P_ *\)-matrices are just sufficient
cites work: Determining the handicap of a sufficient matrix
cites work: A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps
cites work: A new primal-dual path-following interior-point algorithm for semidefinite optimization
cites work: A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
cites work: A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
DOI: 10.1007/S11590-020-01612-0
description: scientific article; zbMATH DE number 7343955