A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function (Q451811): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
The authors present a full-Newton step infeasible interior point method for monotone linear complimentarity problems (LCP). For this purpose, they modify an algorithm proposed by Mansouri, Zangiabadi, and Pirhaji. That is, instead of a logarithmic barrier function, this paper propose to use a simple locally-kernel function for the computation of the search directions. The authors present a complete theoretical analysis of their approach together with a complexity bound but no numerical results. | |||
| Property / review text: The authors present a full-Newton step infeasible interior point method for monotone linear complimentarity problems (LCP). For this purpose, they modify an algorithm proposed by Mansouri, Zangiabadi, and Pirhaji. That is, instead of a logarithmic barrier function, this paper propose to use a simple locally-kernel function for the computation of the search directions. The authors present a complete theoretical analysis of their approach together with a complexity bound but no numerical results. / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Andrea Walther / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C51 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6085771 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
interior-point algorithm | |||
| Property / zbMATH Keywords: interior-point algorithm / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
monotone linear complementarity problems | |||
| Property / zbMATH Keywords: monotone linear complementarity problems / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
complexity analysis | |||
| Property / zbMATH Keywords: complexity analysis / rank | |||
Normal rank | |||
Revision as of 10:34, 30 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function |
scientific article |
Statements
A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function (English)
0 references
24 September 2012
0 references
The authors present a full-Newton step infeasible interior point method for monotone linear complimentarity problems (LCP). For this purpose, they modify an algorithm proposed by Mansouri, Zangiabadi, and Pirhaji. That is, instead of a logarithmic barrier function, this paper propose to use a simple locally-kernel function for the computation of the search directions. The authors present a complete theoretical analysis of their approach together with a complexity bound but no numerical results.
0 references
interior-point algorithm
0 references
monotone linear complementarity problems
0 references
complexity analysis
0 references
