Closing the iteration gap in linear programming with a new kernel function (Q6952168)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

Closing the iteration gap in linear programming with a new kernel function

scientific article; zbMATH DE number 8070547

Language	Label	Description	Also known as
default for all languages	No label defined
English	Closing the iteration gap in linear programming with a new kernel function	scientific article; zbMATH DE number 8070547

Statements

instance of

scholarly article

0 references

title

Closing the iteration gap in linear programming with a new kernel function (English)

0 references

author

Imene Touil

0 references

published in

Bulletin of the Malaysian Mathematical Sciences Society. Second Series

0 references

publication date

28 July 2025

0 references

zbMATH Keywords

linear programming

0 references

primal-dual interior-point methods

0 references

kernel functions

0 references

complexity analysis

0 references

large- and small-update methods

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

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

0 references

Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization

0 references

A polynomial-time algorithm for linear optimization based on a new simple kernel function

0 references

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

0 references

A class of large-update and small-update primal-dual interior-point algorithms for linear optimization

0 references

Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions

0 references

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

0 references

Complexity analysis of primal-dual interior-point methods for linear optimization based on a new efficient bi-parameterized kernel function with a trigonometric barrier term

0 references

An efficient parameterized logarithmic kernel function for linear optimization

0 references

A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function

0 references

Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function

0 references

A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function

0 references

A new parametric kernel function yielding the best known iteration bounds of interior-point methods for the Cartesian \(P_\ast( \kappa)\)-SCLCP

0 references

A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions

0 references

On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function

0 references

Q3504911

0 references

Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term

0 references

Primal-dual algorithms for \(P_\ast(\kappa)\) linear complementarity problems based on kernel-function with trigonometric barrier term

0 references

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

0 references

Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term

0 references

An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function

0 references

An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization

0 references

Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions

0 references

A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions

0 references

A new polynomial-time algorithm for linear programming

0 references

Primal-dual interior-point algorithm for LO based on a new kernel function

0 references

A new parametric kernel function with a trigonometric barrier term for \(P_*(\kappa)\)-linear complementarity problems

0 references

Q4324980

0 references

A new and efficient large-update interior-point method for linear optimization

0 references

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

0 references

Q4791754

0 references

A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions

0 references

A mathematical view of interior-point methods in convex optimization

0 references

Q4339096

0 references

Q4693067

0 references

A feasible primal-dual interior point method for linear semidefinite programming

0 references

Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions

0 references

Q5085900

0 references

Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems

0 references

An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming

0 references

A novel kernel function bridging iteration bounds in interior-point algorithms for linear programming.

0 references

Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function

0 references

A new primal-dual interior-point algorithm for convex quadratic optimization

0 references

Identifiers

zbMATH Open document ID

1569.90099

0 references

DOI

10.1007/S40840-025-01907-4

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Closing the iteration gap in linear programming with a new kernel function