A full-Newton step infeasible interior-point algorithm for monotone LCP based on a locally-kernel function (Q451811): Difference between revisions

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

reviewed by

Andrea Walther

0 references

zbMATH Keywords

interior-point algorithm

0 references

monotone linear complementarity problems

0 references

complexity analysis

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1007/s11075-011-9530-1

0 references

cites work

The Linear Complementarity Problem

0 references

A unified approach to interior point algorithms for linear complementarity problems: A summary

0 references

Homotopy Continuation Methods for Nonlinear Complementarity Problems

0 references

A polynomial-time algorithm for a class of linear complementarity problems

0 references

A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems

0 references

An Algorithm for Convex Quadratic Programming That Requires O(n3.5L) Arithmetic Operations

0 references

A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs

0 references

On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming

0 references

Interior path following primal-dual algorithms. II: Convex quadratic programming

0 references

An Infeasible Interior Point Method for Linear Complementarity Problems over Symmetric Cones

0 references

A path following method for LCP with superlinearly convergent iteration sequence

0 references

A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization

0 references

An infeasible-interior-point algorithm for linear complementarity problems

0 references

Q4347848

0 references

Convergence analysis of an infeasible interior point algorithm based on a regularized central path for linear complementarity problems

0 references

Identifiers

zbMATH Open document ID

1263.65055

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1007/S11075-011-9530-1

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:451811

@@ Property / DOI @@
-.1007/s11075-011-9530-1
@@ Property / DOI: 10.1007/s11075-011-9530-1 / rank @@
-Normal rank
@@ 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.
+Normal rank
@@ Property / reviewed by @@
+Andrea Walther
@@ Property / reviewed by: Andrea Walther / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+K05
@@ Property / Mathematics Subject Classification ID: 65K05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C51
@@ Property / Mathematics Subject Classification ID: 90C51 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6085771
@@ 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
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s11075-011-9530-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2012799950
@@ Property / OpenAlex ID: W2012799950 / rank @@
+Normal rank
@@ Property / cites work @@
+The Linear Complementarity Problem
@@ Property / cites work: The Linear Complementarity Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A unified approach to interior point algorithms for linear complementarity problems: A summary
+Normal rank
@@ Property / cites work @@
+Homotopy Continuation Methods for Nonlinear Complementarity Problems
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for a class of linear complementarity problems
+Normal rank
@@ Property / cites work @@
+A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems
+Normal rank
@@ Property / cites work @@
+An Algorithm for Convex Quadratic Programming That Requires <i>O</i>(<i>n</i><sup>3.5</sup><i>L</i>) Arithmetic Operations
+Normal rank
@@ Property / cites work @@
+A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
+Normal rank
@@ Property / cites work @@
+On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
+Normal rank
@@ Property / cites work @@
+Interior path following primal-dual algorithms. II: Convex quadratic programming
+Normal rank
@@ Property / cites work @@
+An Infeasible Interior Point Method for Linear Complementarity Problems over Symmetric Cones
+Normal rank
@@ Property / cites work @@
+A path following method for LCP with superlinearly convergent iteration sequence
+Normal rank
@@ Property / cites work @@
+A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
+Normal rank
@@ Property / cites work @@
+An infeasible-interior-point algorithm for linear complementarity problems
+Normal rank
@@ Property / cites work @@
+Q4347848
@@ Property / cites work: Q4347848 / rank @@
+Normal rank
@@ Property / cites work @@
+Convergence analysis of an infeasible interior point algorithm based on a regularized central path for linear complementarity problems
+Normal rank
@@ Property / DOI @@
+.1007/S11075-011-9530-1
@@ Property / DOI: 10.1007/S11075-011-9530-1 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:451811