A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem (Q6492455)

scientific article; zbMATH DE number 7838116

Language	Label	Description	Also known as
English	A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem	scientific article; zbMATH DE number 7838116

Statements

instance of

scholarly article

0 references

title

A New full-newton step infeasible interior-point method for $$P_*(\kappa )$$-linear Complementarity problem (English)

0 references

0 references

0 references

0 references

0 references

0 references

25 April 2024

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

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

0 references

Determining the handicap of a sufficient matrix

0 references

A new polynomial-time algorithm for linear programming

0 references

An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term

0 references

A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound

0 references

A path following interior-point method for linear complementarity problems over circular cones

0 references

Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction

0 references

Predictor-corrector interior-point algorithm for $P_*(\kappa)$-linear complementarity problems based on a new type of algebraic equivalent transformation technique

0 references

Q4988036

0 references

Q5013537

0 references

Improved complexity analysis of full Nesterov-Todd step interior-point methods for semidefinite optimization

0 references

Q2789173

0 references

Q5501731

0 references

A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming

0 references

Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization

0 references

An Improved and Simplified Full-Newton Step $O(n)$ Infeasible Interior-Point Method for Linear Optimization

0 references

An arc-search ${\mathcal {O}}(nL)$ infeasible-interior-point algorithm for linear programming

0 references

A second-order corrector wide neighborhood infeasible interior-point method for linear optimization based on a specific kernel function

0 references

An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function

0 references

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

0 references

Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function

0 references

A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization

0 references

A Linear Complementarity Problem with a P-Matrix

0 references

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

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

An improved and modified infeasible interior-point method for symmetric optimization

0 references

Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier

0 references

Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function

0 references

An infeasible interior-point method for the $P*$-matrix linear complementarity problem based on a trigonometric kernel function with full-Newton step

0 references

An interior-point method for $P_*(\kappa)$-linear complementarity problem based on a trigonometric kernel function

0 references

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

0 references

Q4339096

0 references

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

0 references

A new complexity analysis for full-Newton step infeasible interior-point algorithm for horizontal linear complementarity problems

0 references

A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization

0 references

Q4791203

0 references

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

0 references

On the complexity of computing the handicap of a sufficient matrix

0 references

Identifiers

DOI

10.1007/s11590-023-02025-5

0 references

Mathematics Subject Classification ID

90Cxx

0 references

zbMATH DE Number

7838116

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6492455