An Effcient Primal-dual Interior Point Algorithm for Linear Optimization Problems Based an a New Parameterized Kernel Function With a Logarithmic Barrier Term

Résumé

Abstract In this paper, We present a primal-dual interior point method for linear optimization problems based on a new kernel function with on a new parameterized logarithmic barrier term. We prove that the proposed kernel function belongs to the eligible class. We derive the complexity bounds for large and small-update methods respectively.

Citer ce document

Accès au document

Ce document est hébergé sur son dépôt institutionnel d'origine.

Auteur(s)

Statistiques

Consultations : 1

Téléchargements : 0