Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function

DOI10.5269/bspm.47772OpenAlexW4210568808MaRDI QIDQ6189573

Nawel Boudjellal, Hayet Roumili, Djamel Benterki

Publication date: 8 February 2024

Published in: Boletim da Sociedade Paranaense de Matemática (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5269/bspm.47772

zbMATH Keywords

kernel functionconvex quadratic programminginterior point methodsiteration bound

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

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
• Complexity analysis of an interior-point algorithm for linear optimization based on a new proximity function
• 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 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 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: Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function