A logarithmic barrier approach for linear programming

DOI10.1016/J.CAM.2016.05.025zbMath1349.90673OpenAlexW2465859160MaRDI QIDQ329787

Djamel Benterki, Linda Menniche

Publication date: 21 October 2016

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2016.05.025

zbMATH Keywords

linear programminginterior point methodslogarithmic barrier methods

Mathematics Subject Classification ID

Semidefinite programming (90C22) Interior-point methods (90C51)

Related Items (5)

ADAPTATION OF THE MINORANT FUNCTION FOR LINEAR PROGRAMMING ⋮ An efficient logarithmic barrier method without line search for convex quadratic programming ⋮ A logarithmic barrier interior-point method based on majorant functions for second-order cone programming ⋮ Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming ⋮ Logarithmic Barrier Method Via Minorant Function for Linear Programming

Cites Work

• An extended variant of Karmarkar's interior point algorithm
• Extension of a projective interior point method for linearly constrained convex programming
• An extension of Karmarkar's projective algorithm for convex quadratic programming
• New bounds for the extreme values of a finite sample of real numbers
• A logarithm barrier method for semi-definite programming
• A numerical feasible interior point method for linear semidefinite programs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A logarithmic barrier approach for linear programming