An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
From MaRDI portal
Publication:2303523
DOI10.1007/s11081-019-09436-3zbMath1433.90085OpenAlexW2927382655WikidataQ115602955 ScholiaQ115602955MaRDI QIDQ2303523
Publication date: 4 March 2020
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11081-019-09436-3
interior-point methodslinear optimizationiteration complexitylarge-update methodsfinite barrier function
Related Items (2)
An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization ⋮ Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
- An efficient parameterized logarithmic kernel function for linear optimization
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
- A new polynomial-time algorithm for linear programming
- A polynomial-time algorithm for linear optimization based on a new class of kernel functions
- 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 analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
- A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
- Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term
This page was built for publication: An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
