Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function
type: Item
instance of: scholarly article
title: Complexity analysis of primal-dual interior-point methods for convex quadratic programming based on a new twice parameterized kernel function
author: Youssra Bouhenache
author: Wided Chikouche
author: Imene Touil
author: Sajad Fathi-Hafshejani
published in: Journal of Mathematical Modeling
publication date: 2025-01-14T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 7966764
zbMATH Keywords: convex quadratic programming
zbMATH Keywords: kernel function
zbMATH Keywords: interior-point methods
zbMATH Keywords: large- and small-update methods
MaRDI profile type: Publication
cites work: Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term
cites work: A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
cites work: A class of large-update and small-update primal-dual interior-point algorithms for linear optimization
cites work: An efficient twice parameterized trigonometric kernel function for linear optimization
cites work: Complexity analysis of primal-dual interior-point methods for linear optimization based on a new efficient Bi-parameterized kernel function with a trigonometric barrier term
cites work: Complexity analysis of interior point methods for convex quadratic programming based on a parameterized Kernel function
cites work: A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
cites work: A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function
cites work: Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier
cites work: Q3561471
cites work: A polynomial-time algorithm for linear optimization based on a new class of kernel functions
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: A polynomial-time algorithm for linear optimization based on a new kernel function with trigonometric barrier term
cites work: Q3491304
cites work: Kernel function based interior-point algorithms for semidefinite optimization
cites work: Q4206561
cites work: Q4324980
cites work: A new and efficient large-update interior-point method for linear optimization
cites work: Q4791754
cites work: A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem
cites work: A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION
cites work: AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS
cites work: A new primal-dual interior-point algorithm for convex quadratic optimization
cites work: Primal-dual interior point methods for Semidefinite programming based on a new type of kernel functions
cites work: Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems
DOI: 10.22124/JMM.2024.25394.2257
description: scientific article; zbMATH DE number 7966764