A logarithmic barrier approach for linear programming
From MaRDI portal
Publication:329787
DOI10.1016/J.CAM.2016.05.025zbMATH Open1349.90673OpenAlexW2465859160MaRDI QIDQ329787FDOQ329787
Authors: Linda Menniche, Djamel Benterki
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
- A numerical feasible interior point method for linear semidefinite programs
- A weighted-path-following method for the linear complementarity problem
- A weighted-path-following method for linear optimization
- An extended variant of Karmarkar's interior point algorithm
- Extension of a projective interior point method for linearly constrained convex programming
Cited In (17)
- An efficient logarithmic barrier method without line search for convex quadratic programming
- Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming
- Adaptation of the minorant function for linear programming
- A logarithm barrier method for semi-definite programming
- Line Search Techniques for the Logarithmic Barrier Function in Quadratic Programming
- Title not available (Why is that?)
- A logarithm barrier method for linear programming
- Some Convergence Properties of the Modified Log Barrier Method for Linear Programming
- Inverse barrier methods for linear programming
- Logarithmic Barrier Method Via Minorant Function for Linear Programming
- On controlling the parameter in the logarithmic barrier term for convex programming problems
- A Logarithmic Barrier Approach To Solving The Dashboard Planning Problem
- Logarithmic barrier method via minorant function for linear semidefinite programming
- A Newton descent logarithmic barrier interior-point algorithm for monotone LCP
- The role of linear objective functions in barrier methods
- Title not available (Why is that?)
- A logarithmic barrier interior-point method based on majorant functions for second-order cone programming
This page was built for publication: A logarithmic barrier approach for linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q329787)