A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function
type: Item
instance of: scholarly article
title: A large-update primal-dual interior-point algorithm for convex quadratic optimization based on a new bi-parameterized bi-hyperbolic Kernel function
author: Youssra Bouhenache
author: Wided Chikouche
author: Imene Touil
published in: Lobachevskii Journal of Mathematics
publication date: 2024-08-13T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 7896193
zbMATH Keywords: interior-point methods
zbMATH Keywords: convex quadratic optimization
zbMATH Keywords: hyperbolic kernel function
zbMATH Keywords: large-update methods
MaRDI profile type: MaRDI publication profile
cites work: A primal‐dual interior-point method for linear optimization based on a new proximity function
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: Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
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: A primal-dual interior point algorithm for convex quadratic programming based on a new parametric kernel function
cites work: Complexity analysis of interior point methods for convex quadratic programming based on a parameterized 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: Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
cites work: Q5144448
cites work: Kernel-function Based Algorithms for Semidefinite Optimization
cites work: An interior-point algorithm for $P_{ast}(kappa)$-linear complementarity problem based on a new trigonometric kernel function
cites work: Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term
cites work: Complexity of interior point methods for a class of linear complementarity problems using a kernel function with trigonometric growth term
cites work: An interior point algorithm for solving linear optimization problems using a new trigonometric kernel function
cites work: A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term
cites work: A new polynomial-time algorithm for linear programming
cites work: Unified Analysis of Kernel-Based Interior-Point Methods for $P_*(\kappa)$-Linear Complementarity Problems
cites work: Interior path following primal-dual algorithms. II: Convex quadratic 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: A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem
cites work: A primal-dual interior-point method for semidefinite optimization based on a class of trigonometric barrier functions
cites work: Q4339096
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
cites work: A new primal-dual interior-point algorithm for convex quadratic optimization
cites work: Primal-dual interior-point algorithm for convex quadratic semi-definite optimization
cites work: A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO
cites work: A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function
DOI: 10.1134/S1995080224600560
description: scientific article; zbMATH DE number 7896193