An efficient twice parameterized trigonometric kernel function for linear optimization
type: Item
instance of: scholarly article
title: An efficient twice parameterized trigonometric kernel function for linear optimization
zbMATH Open document ID: 1447.90018
author: Mousaab Bouafia
author: Adnan Yassine
published in: Optimization and Engineering
publication date: 2020-07-14T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 7220219
zbMATH Keywords: linear optimization
zbMATH Keywords: kernel function
zbMATH Keywords: interior point methods
zbMATH Keywords: complexity bound
MaRDI profile type: Publication
full work available at URL: s11081-019-09467-w
OpenAlex ID: W2972460503
cites work: A New Efficient Large-Update Primal-Dual Interior-Point Method Based on a Finite Barrier
cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
cites work: New parameterized kernel functions for linear optimization
cites work: An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
cites work: Complexity analysis of interior point methods for linear programming based on a parameterized kernel function
cites work: An efficient parameterized logarithmic kernel function for linear optimization
cites work: Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
cites work: Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term
cites work: A new polynomial-time algorithm for linear programming
cites work: Interior-point algorithm for linear optimization based on a new trigonometric kernel function
cites work: Q4206561
cites work: A new and efficient large-update interior-point method for linear optimization
cites work: Q4791754
cites work: Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
cites work: Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
cites work: Q4339096
cites work: Q3738934
cites work: Q4382667
Wikidata QID: Q127283716
DOI: 10.1007/S11081-019-09467-W
description: scientific article; zbMATH DE number 7220219