Implementation of interior-point algorithms for some entropy optimization problems
- 1 January 1992
- journal article
- research article
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 1 (1) , 71-80
- https://doi.org/10.1080/10556780708805507
Abstract
In this paper we discuss computational and implementation aspects of the potential reduction interior-point algorithm [17] Potra, F. and Ye, Y. 1990. An interior-point algorithm for solving entropy optimization problems with globally linear and locally quadratic convergence rate. Working Paper No. 90-22, Iowa: College of Business Administration, The University of Iowa. To appear in SIAM J. on Optimization [Google Scholar] for solving entropy optimization problems arisen in practical applications. The algorithm generates an ε-optimal solution within the number of iterations bounded by where ε is the error tolerance, n is the number of nonnegative variables, and each iteration solves a system of linear equations. Preliminary computational results obtained from solving several image reconstruction problems are presented.Keywords
This publication has 10 references indexed in Scilit:
- Algorithms for the solution of quadratic knapsack problemsLinear Algebra and its Applications, 1991
- On some efficient interior point methods for nonlinear convex programmingLinear Algebra and its Applications, 1991
- A Centered Projective Algorithm for Linear ProgrammingMathematics of Operations Research, 1990
- An Extension of Karmarkar Type Algorithm to a Class of Convex Separable Programming Problems with Global Linear Rate of ConvergenceMathematics of Operations Research, 1990
- An Implementation of a Primal-Dual Interior Point Method for Linear ProgrammingINFORMS Journal on Computing, 1989
- A polynomial-time algorithm for a class of linear complementarity problemsMathematical Programming, 1989
- An algorithm for maximizing entropy subject to simple boundsMathematical Programming, 1988
- Maximum likelihood, entropy maximization, and the geometric programming approaches to the calibration of trip distribution modelsTransportation Research Part B: Methodological, 1981
- A relaxation method for reconstructing objects from noisy X-raysMathematical Programming, 1975
- Linear Programming and ExtensionsPublished by Walter de Gruyter GmbH ,1963