A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP (Q5379298)

scientific article; zbMATH DE number 7060056

Language	Label	Description	Also known as
English	A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP	scientific article; zbMATH DE number 7060056

Statements

instance of

scholarly article

0 references

title

A New Search Direction for Full-Newton Step Interior-Point Method in P*(κ)-HLCP (English)

0 references

author

Behrouz Kheirfam

0 references

published in

Numerical Functional Analysis and Optimization

0 references

publication date

28 May 2019

0 references

zbMATH Keywords

full-Newton step

0 references

horizontal linear complementarity problem

0 references

interior-point methods

0 references

polynomial complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/01630563.2019.1598430

0 references

cites work

A new polynomial-time algorithm for linear programming

0 references

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

0 references

A quadratically convergent $\text{O}((\kappa +1)\sqrt n L)$-iteration algorithm for the $P_ *(\kappa)$-matrix linear complementarity problem

0 references

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

0 references

A Large-Step Infeasible-Interior-Point Method for the P*-Matrix LCP

0 references

A Mizuno-Todd-Ye type predictor-corrector algorithm for sufficient linear complementarity problems

0 references

Predictor–corrector methods for sufficient linear complementarity problems in a wide neighborhood of the central path

0 references

An <i>O</i>$(\sqrtn L)$ Iteration Primal-dual Path-following Method, Based on Wide Neighborhoods and Large Updates, for Monotone LCP

0 references

Interior Point Methods for Sufficient Horizontal LCP in a Wide Neighborhood of the Central Path with Best Known Iteration Complexity

0 references

Polynomial convergence of two higher order interior-point methods for $P_*(\kappa)$-LCP in a wide neighborhood of the central path

0 references

A new second-order corrector interior-point algorithm for P*(k)-LCP

0 references

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

0 references

Q4339096

0 references

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

0 references

Q3415802

0 references

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

0 references

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

0 references

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

0 references

A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization

0 references

A new infeasible interior-point method based on Darvay's technique for symmetric optimization

0 references

A predictor-corrector interior-point algorithm for $P_\ast (\kappa )$-horizontal linear complementarity problem

0 references

New method for determining search directions for interior-point algorithms in linear optimization

0 references

Corrector-predictor methods for sufficient linear complementarity problems

0 references

Identifiers

zbMATH Open document ID

1420.90072

0 references

DOI

10.1080/01630563.2019.1598430

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5379298