Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
From MaRDI portal
Publication:1724788
DOI10.1155/2014/710158zbMath1474.90275OpenAlexW2118736602WikidataQ59040812 ScholiaQ59040812MaRDI QIDQ1724788
M. El Ghami, Yu-Jing Yue, Guo-Qiang Wang, Xin-Zhong Cai
Publication date: 14 February 2019
Published in: Abstract and Applied Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2014/710158
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Interior-point methods (90C51)
Related Items
An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term, Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions, An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function, Complexity analysis of an interior-point algorithm for linear optimization based on a new parametric kernel function with a double barrier term, Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions, Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function, An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization, A unified complexity analysis of interior point methods for semidefinite problems based on trigonometric kernel functions, An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term, A generic kernel function for interior point methods, A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function, An efficient parameterized logarithmic kernel function for linear optimization, An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem 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 finite exponential-trigonometric barrier term, A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function, Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term, Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
Cites Work
- Unnamed Item
- Unnamed Item
- 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 class of large-update and small-update primal-dual interior-point algorithms for linear optimization
- Self-regular functions and new search directions for linear and semidefinite optimization
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
