A generic kernel function for interior point methods
From MaRDI portal
Recommendations
- Generic Primal-dual Interior Point Methods Based on a New Kernel Function
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods
- An interior point method for linear programming based on a class of Kernel functions
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions
Cites work
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions
- A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds
- A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
- A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
- 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 algorithm based on general kernel function for monotone linear complementarity problem
- An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term
- 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 interior-point methods for linear optimization based on some conditions on kernel function
- 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 linear optimization based on a new trigonometric kernel function
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- scientific article; zbMATH DE number 4126998 (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 1862745 (Why is no real title available?)
- Interior path following primal-dual algorithms. I: Linear programming
- Interior-point algorithm for linear optimization based on a new trigonometric kernel function
- Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- Limiting behavior of weighted central paths in linear programming
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
- Steplengths in interior-point algorithms of quadratic programming
- Unified analysis of kernel-based interior-point methods for P_*()-linear complementarity problems
Cited in
(7)- The accuracy of interior-point methods based on kernel functions
- Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
- 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 linear programming based on a class of Kernel functions
- scientific article; zbMATH DE number 7551027 (Why is no real title available?)
- A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods
- Environment invariant linear least squares
This page was built for publication: A generic kernel function for interior point methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2245691)
