Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method
From MaRDI portal
Publication:4012424
DOI10.1137/0801018zbMath0754.90035OpenAlexW2005992544MaRDI QIDQ4012424
Publication date: 27 September 1992
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0801018
Linear programming (90C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Primal-dual algorithms for linear programming based on the logarithmic barrier method, Fast convergence of the simplified largest step path following algorithm, The largest step path following algorithm for monotone linear complementarity problems, Large step volumetric potential reduction algorithms for linear programming, A cutting plane method from analytic centers for stochastic programming, IFORS' Operational Research Hall of Fame: Clóvis Caesar Gonzaga, A survey of search directions in interior point methods for linear programming, A long-step barrier method for convex quadratic programming, Convergence behavior of interior-point algorithms, On partial updating in a potential reduction linear programming algorithm of Kojima, Mizuno, and Yoshise, General central path and the largest step general central path following algorithm for linear programming, An interior point method for quadratic programs based on conjugate projected gradients, Long-step interior-point algorithms for a class of variational inequalities with monotone operators, Degeneracy in interior point methods for linear programming: A survey, An alternative derivation of the projective interior point method for linear programming through the least squares approach, Strict monotonicity and improved complexity in the standard form projective algorithm for linear programming, A potential-reduction variant of Renegar's short-step path-following method for linear programming, On the classical logarithmic barrier function method for a class of smooth convex programming problems, On the number of iterations of Karmarkar's algorithm for linear programming
