On the classical logarithmic barrier function method for a class of smooth convex programming problems
- 1 April 1992
- journal article
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 73 (1) , 1-25
- https://doi.org/10.1007/bf00940075
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- On the method of analytic centers for solving smooth convex programsPublished by Springer Nature ,2006
- An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programmingPublished by Springer Nature ,2006
- A potential-reduction variant of Renegar's short-step path-following method for linear programmingLinear Algebra and its Applications, 1991
- On the convergence of the method of analytic centers when applied to convex quadratic programsMathematical Programming, 1990
- An algorithm for linear programming which requires O(((m+n)n 2+(m+n)1.5 n)L) arithmetic operationsMathematical Programming, 1990
- An Algorithm for Solving Linear Programming Problems in O(n 3 L) OperationsPublished by Springer Nature ,1989
- A polynomial-time algorithm, based on Newton's method, for linear programmingMathematical Programming, 1988
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective methodMathematical Programming, 1986
- A new polynomial-time algorithm for linear programmingCombinatorica, 1984
- A duality theorem for non-linear programmingQuarterly of Applied Mathematics, 1961