An efficient 2-parameter hyperbolic kernel-function-based interior-point method for linear programming
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3972641 (Why is no real title available?)
- scientific article; zbMATH DE number 1862745 (Why is no real title available?)
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function
- A new and efficient large-update interior-point method for linear optimization
- A new class of polynomial primal-dual methods for linear and semidefinite optimization
- A new parameterized logarithmic kernel function for linear optimization with a double barrier term yielding the best known iteration bound
- A new parametric kernel function yielding the best known iteration bounds of interior-point methods for the Cartesian \(P_\ast( \kappa)\)-SCLCP
- A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term
- A primal-dual large-update interior-point algorithm for P_*()-LCP based on a new class of kernel functions
- An efficient bi-parametric hyperbolic kernel function yielding the best known iteration bounds for linear programming
- 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 finite exponential-trigonometric barrier term
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
- An efficient twice parameterized trigonometric kernel function for linear optimization
- An interior point method for \(P_*(\kappa)\)-horizontal linear complementarity problem based on a new proximity function
- An interior-point method for P_*()-linear complementarity problem based on a trigonometric kernel function
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity 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 semidefinite optimization based on a 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
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- Interior-point algorithm for linear optimization based on a new trigonometric kernel function
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- New interior point algorithms in linear programming
- 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 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 algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
- Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
- Primal-dual interior-point method for linear optimization based on a kernel function with trigonometric growth term
- Self-regular functions and new search directions for linear and semidefinite optimization
This page was built for publication: An efficient 2-parameter hyperbolic kernel-function-based interior-point method for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232668)
