An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function (Q2634322): Difference between revisions

Latest revision as of 11:02, 11 July 2024

scientific article

Language	Label	Description	Also known as
English	An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function	scientific article

Statements

instance of

scholarly article

0 references

title

An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function (English)

0 references

zbMATH Open document ID

1330.90133

0 references

DOI

10.1007/s12190-014-0856-4

0 references

author

Yanyan Li

0 references

published in

Journal of Applied Mathematics and Computing

0 references

publication date

9 February 2016

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

horizontal linear complementarity problem

0 references

central path

0 references

infeasible full-Newton step method

0 references

kernel function

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s12190-014-0856-4

0 references

OpenAlex ID

W2062012290

0 references

cites work

A new primal-dual path-following method for convex quadratic programming

0 references

Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems

0 references

A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems

0 references

An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP

0 references

A New Infinity-Norm Path Following Algorithm for Linear Programming

0 references

Q3415802

0 references

A polynomial-time algorithm for linear optimization based on a new class of kernel functions

0 references

Corrector-predictor methods for sufficient linear complementarity problems

0 references

A new polynomial-time algorithm for linear programming

0 references

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

0 references

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

0 references

Q3104085

0 references

Kernel function based interior-point methods for horizontal linear complementarity problems

0 references

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

0 references

A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization

0 references

Simplified<i>O</i>(<i>nL</i>) infeasible interior-point algorithm for linear optimization using full-Newton steps

0 references

A polynomial interior-point algorithm for monotone linear complementarity problems

0 references

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

0 references

Self-regular functions and new search directions for linear and semidefinite optimization

0 references

Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems

0 references

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

0 references

Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity

0 references

Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem

0 references

A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems

0 references

A new primal-dual path-following interior-point algorithm for semidefinite optimization

0 references

A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step

0 references

A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization

0 references

An extension of Karmarkar's projective algorithm for convex quadratic programming

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2634322

@@ Property / cites work @@
+A new primal-dual path-following method for convex quadratic programming
+Normal rank
@@ Property / cites work @@
+Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems
+Normal rank
@@ Property / cites work @@
+A Full-Newton step infeasible-interior-point algorithm for P*(k)-horizontal linear complementarity problems
+Normal rank
@@ Property / cites work @@
+An infeasible-interior-point predictor-corrector algorithm for the \(P_ *\)-geometric LCP
+Normal rank
@@ Property / cites work @@
+A New Infinity-Norm Path Following Algorithm for Linear Programming
+Normal rank
@@ Property / cites work @@
+Q3415802
@@ Property / cites work: Q3415802 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for linear optimization based on a new class of kernel functions
+Normal rank
@@ Property / cites work @@
+Corrector-predictor methods for sufficient linear complementarity problems
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for a class of linear complementarity problems
+Normal rank
@@ Property / cites work @@
+A unified approach to interior point algorithms for linear complementarity problems: A summary
+Normal rank
@@ Property / cites work @@
+Q3104085
@@ Property / cites work: Q3104085 / rank @@
+Normal rank
@@ Property / cites work @@
+Kernel function based interior-point methods for horizontal 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 @@
+A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
+Normal rank
@@ Property / cites work @@
+Simplified<i>O</i>(<i>nL</i>) infeasible interior-point algorithm for linear optimization using full-Newton steps
+Normal rank
@@ Property / cites work @@
+A polynomial interior-point algorithm for monotone linear complementarity problems
+Normal rank
@@ Property / cites work @@
+On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
+Normal rank
@@ Property / cites work @@
+Self-regular functions and new search directions for linear and semidefinite optimization
+Normal rank
@@ Property / cites work @@
+Primal-Dual Affine Scaling Interior Point Methods for Linear Complementarity Problems
+Normal rank
@@ Property / cites work @@
+A Full-Newton Step O(n) Infeasible Interior-Point Algorithm for Linear Optimization
+Normal rank
@@ Property / cites work @@
+Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
+Normal rank
@@ Property / cites work @@
+Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
+Normal rank
@@ Property / cites work @@
+A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
+Normal rank
@@ Property / cites work @@
+A new primal-dual path-following interior-point algorithm for semidefinite optimization
+Normal rank
@@ Property / cites work @@
+A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
+Normal rank
@@ Property / cites work @@
+A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
+Normal rank
@@ Property / cites work @@
+An extension of Karmarkar's projective algorithm for convex quadratic programming
+Normal rank