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

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
An efficient parameterized logarithmic kernel function for linear optimization
A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions
Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric 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
A new class of polynomial primal-dual methods for linear and semidefinite optimization
Self-regular functions and new search directions for linear and semidefinite optimization
Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term
An efficient parameterized logarithmic kernel function for semidefinite optimization
A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound
Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
A new and efficient large-update interior-point method for linear optimization
Generic Primal-dual Interior Point Methods Based on a New Kernel Function
A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions

This page was built for publication: An efficient hyperbolic kernel function yielding the best known iteration bounds for linear programming

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