Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
type: Item
instance of: scholarly article
title: Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
zbMATH Open document ID: 1487.90518
author: Imene Touil
author: Wided Chikouche
published in: Acta Mathematicae Applicatae Sinica. English Series
publication date: 2022-03-15T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 7490417
zbMATH Keywords: linear semidefinite programming
zbMATH Keywords: primal-dual interior point methods
zbMATH Keywords: hyperbolic kernel function
zbMATH Keywords: complexity analysis
zbMATH Keywords: large and small-update methods
describes a project that uses: SeDuMi
MaRDI profile type: Publication
full work available at URL: s10255-022-1061-0
OpenAlex ID: W4210475115
Wikidata QID: Q115605850
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: A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms
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 twice parameterized trigonometric kernel function for linear optimization
cites work: A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
cites work: Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term
cites work: On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function
cites work: Q3504911
cites work: Interior-point methods for linear optimization based on a kernel function with a trigonometric barrier term
cites work: An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
cites work: An Interior-Point Method for Semidefinite Programming
cites work: Q4040931
cites work: A new polynomial-time algorithm for linear programming
cites work: Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
cites work: Interior-point algorithm for linear optimization based on a new trigonometric kernel function
cites work: A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
cites work: Q4716820
cites work: A generic kernel function for interior point methods
cites work: A note on the existence of the Alizadeh-Haeberly-Overton direction for semidefinite programming
cites work: A new and efficient large-update interior-point method for linear optimization
cites work: Self-regular functions and new search directions for linear and semidefinite optimization
cites work: Q4791754
cites work: Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
cites work: A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
cites work: Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
cites work: Complexity analysis of interior-point algorithm based on a new kernel function for semidefinite optimization
cites work: Q4339096
cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
cites work: On the Nesterov--Todd Direction in Semidefinite Programming
cites work: A feasible primal-dual interior point method for linear semidefinite programming
cites work: Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function
cites work: Handbook of semidefinite programming. Theory, algorithms, and applications
cites work: Q5691079
cites work: Q4382667
cites work: A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
cites work: On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
DOI: 10.1007/S10255-022-1061-0
Recommended article: Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions
Recommended article: Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term
Recommended article: A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
Recommended article: A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function
Recommended article: An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a trigonometric barrier term
Recommended article: A generic primal–dual interior-point method for semidefinite optimization based on a new class of kernel functions
Recommended article: An efficient primal-dual interior point method for linear programming problems based on a new kernel function with a finite exponential-trigonometric barrier term
Recommended article: Q3106500
Recommended article: A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
Recommended article: Q3454068
description: scientific article; zbMATH DE number 7490417