Theoretical and Numerical Result for Linear Optimization Problem Based on a New Kernel Function

DOI10.17516/1997-1397-2019-12-2-160-172OpenAlexW2924863458WikidataQ128192757 ScholiaQ128192757MaRDI QIDQ5853368

Louiza Derbal, Zakia Kebbiche

Publication date: 18 March 2021

Published in: Journal of Siberian Federal University. Mathematics & Physics (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/jsfu745

zbMATH Keywords

kernel functioninterior point algorithmslinear optimizationcomplexity boundprimal-dual methods

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Related Items (3)

Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions ⋮ Unnamed Item ⋮ An efficient parameterized logarithmic kernel function for semidefinite optimization

Cites Work

• An efficient parameterized logarithmic kernel function for linear optimization
• A new polynomial-time algorithm for linear programming
• Linear programming: foundations and extensions
• A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm
• A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function
• Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming
• A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Theoretical and Numerical Result for Linear Optimization Problem Based on a New Kernel Function