Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term
From MaRDI portal
Publication:4646520
DOI10.1080/02331934.2018.1482297zbMath1416.90020OpenAlexW2883106675MaRDI QIDQ4646520
No author found.
Publication date: 14 January 2019
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2018.1482297
kernel functionlinear optimizationprimal-dual interior-point methodslarge-update methodstrigonometric growth term
Related Items (3)
An interior-point algorithm for linearly constrained convex optimization based on kernel function and application in non-negative matrix factorization ⋮ 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 twice parameterized trigonometric kernel function for linear optimization
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
- An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term
- Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
- Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
- A new polynomial-time algorithm for linear programming
- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- Interior path following primal-dual algorithms. I: Linear programming
- Steplengths in interior-point algorithms of quadratic programming
- Interior-point algorithm for linear optimization based on a new trigonometric kernel function
- A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
- Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
- An interior-point method for \(P_*(\kappa)\)-linear complementarity problem based on a trigonometric kernel function
- A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function
- A primal‐dual interior-point method for linear optimization based on a new proximity function
- An Interior Point Algorithm for Solving Convex Quadratic Semidefinite Optimization Problems Using a New Kernel Function
- Primal-Dual Algorithms for P ∗(κ) Linear Complementarity Problems Based on Kernel-Function with Trigonometric Barrier Term
- 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 Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
This page was built for publication: Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term
