Primal-dual entropy-based interior-point algorithms for linear optimization

DOI10.1051/ro/2016020zbMath1365.90166arXiv1410.8226OpenAlexW2963833760MaRDI QIDQ5269350

Shen Luo, Tunçel, Levent, Mehdi Karimi

Publication date: 15 June 2017

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.8226

zbMATH Keywords

interior-point methodscentral pathsearch directionhomogeneous and self-dual embeddingprimal-dual entropy

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51) Measures of information, entropy (94A17) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)

Related Items (2)

Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations ⋮ Predictor-corrector interior-point algorithm for \(P_*(\kappa)\)-linear complementarity problems based on a new type of algebraic equivalent transformation technique

This page was built for publication: Primal-dual entropy-based interior-point algorithms for linear optimization