An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function
From MaRDI portal
Publication:5089362
DOI10.2298/FIL2005471FOpenAlexW3128511594MaRDI QIDQ5089362FDOQ5089362
Authors:
Publication date: 19 July 2022
Published in: Filomat (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/fil2005471f
Recommendations
- Interior-point algorithm for linear optimization based on a new trigonometric kernel function
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- Primal-dual interior-point method for linear optimization based on a kernel function with trigonometric growth term
Cites Work
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Title not available (Why is that?)
- Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interior path following primal-dual algorithms. I: Linear programming
- Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
- Interior-point algorithm for linear optimization based on a new trigonometric kernel function
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
- A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
- A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
- Generic Primal-dual Interior Point Methods Based on a New Kernel Function
- An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
- Primal-dual algorithms for \(P_\ast(\kappa)\) linear complementarity problems based on kernel-function with trigonometric barrier term
- An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term
- A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem
- An efficient parameterized logarithmic kernel function for linear optimization
- A new interior-point algorithm for \(P_{\ast}(k)\)-NCP based on a class of parametric kernel functions
- A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
- An interior-point algorithm for \(P_{ast}(kappa)\)-linear complementarity problem based on a new trigonometric kernel function
- A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions
- A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function
- An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
Cited In (14)
- An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization
- A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function
- An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
- An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
- A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term
- Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
- A wide neighborhood interior-point algorithm based on the trigonometric kernel function
- An efficient twice parameterized trigonometric kernel function for linear optimization
- Interior-point algorithm for linear optimization based on a new trigonometric kernel function
- A wide neighborhood interior-point algorithm for linear optimization based on a specific kernel function
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- A full-Newton step infeasible interior-point method based on a trigonometric kernel function without centering steps
- A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function
- Primal-dual interior-point method for linear optimization based on a kernel function with trigonometric growth term
This page was built for publication: An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089362)
