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

Cites work

scientific article; zbMATH DE number 5289787 (Why is no real title available?)
scientific article; zbMATH DE number 729680 (Why is no real title available?)
scientific article; zbMATH DE number 1017028 (Why is no real title available?)
scientific article; zbMATH DE number 195106 (Why is no real title available?)
scientific article; zbMATH DE number 1862745 (Why is no real title available?)
scientific article; zbMATH DE number 7551027 (Why is no real title available?)
A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
A feasible primal-dual interior point method for linear semidefinite programming
A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function
A mathematical view of interior-point methods in convex optimization
A new and efficient large-update interior-point method for linear optimization
A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions
A new parametric kernel function with a trigonometric barrier term for \(P_*(\kappa)\)-linear complementarity problems
A new parametric kernel function yielding the best known iteration bounds of interior-point methods for the Cartesian \(P_\ast( \kappa)\)-SCLCP
A new polynomial-time algorithm for linear programming
A new primal-dual interior-point algorithm for convex quadratic optimization
A new primal-dual path-following method for convex quadratic programming
A novel kernel function bridging iteration bounds in interior-point algorithms for linear programming.
A polynomial-time algorithm for linear optimization based on a new simple kernel function
A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions
An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming
An efficient parameterized logarithmic kernel function for linear optimization
An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function
An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization
An interior-point method for P_*()-linear complementarity problem based on a trigonometric kernel function
Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function
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
Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term
Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
Primal-dual algorithms for \(P_\ast(\kappa)\) linear complementarity problems based on kernel-function with trigonometric barrier term
Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions
Primal-dual interior-point algorithm for LO based on a new kernel function
Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
Self-regular functions and new search directions for linear and semidefinite optimization

This page was built for publication: Closing the iteration gap in linear programming with a new kernel function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6952168)