An adaptive infeasible interior-point algorithm for linear complementarity problems
type: Item
instance of: scholarly article
title: An adaptive infeasible interior-point algorithm for linear complementarity problems
zbMATH Open document ID: 1305.90396
author: Hossein Mansouri
author: M. Pirhaji
published in: Journal of the Operations Research Society of China
publication date: 2014-09-30T00:00:00Z
Mathematics Subject Classification ID: 90C33
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 6350127
zbMATH Keywords: linear complementarity problem
zbMATH Keywords: infeasible-interior-point-method
zbMATH Keywords: central path
zbMATH Keywords: polynomial complexity
MaRDI profile type: Publication
full work available at URL: s40305-013-0031-x
OpenAlex ID: W1988419666
cites work: On a homogeneous algorithm for the monotone complementarity problem
cites work: Q5453751
cites work: Q3491304
cites work: A unified approach to interior point algorithms for linear complementary problems
cites work: Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
cites work: Feasibility issues in a primal-dual interior-point method for linear programming
cites work: A polynomial interior-point algorithm for monotone linear complementarity problems
cites work: An adaptive infeasible interior-point algorithm with full-Newton step for linear optimization
cites work: A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
cites work: Q3477904
cites work: Self-regular functions and new search directions for linear and semidefinite optimization
cites work: Q4791754
cites work: A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
cites work: An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
cites work: An \(O(nL)\) infeasible-interior-point algorithm for LCP with quadratic convergence
cites work: A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
cites work: Test examples for nonlinear programming codes
cites work: Q3804467
cites work: Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
cites work: Improved infeasible-interior-point algorithm for linear complementarity problerns
cites work: On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
DOI: 10.1007/S40305-013-0031-X
description: scientific article; zbMATH DE number 6350127