Entropic approach to interior point solution of linear programs

Authors:
M. Diasparra;H. Gzyl
Affiliations:
Depto. de Cómputo y Estadística, Universidad Simón Bolivar, A.P. 89000, Caracas 1080-A, Venezuela;Depto. de Cómputo y Estadística, Universidad Simón Bolivar, A.P. 89000, Caracas 1080-A, Venezuela
Venue:
Applied Mathematics and Computation
Year:
2003

Citing 2
Cited 1

The maximum entropy method on the mean: applications to linear programming and superresolution

Mathematical Programming: Series A and B
Asymptotic analysis of the exponential penalty trajectory in linear programming

Mathematical Programming: Series A and B

A DEA-Benchmarking optimization model and method based on the theory of maximum entropy

ICIC'06 Proceedings of the 2006 international conference on Intelligent Computing - Volume Part I

Quantified Score

Hi-index	0.48

Visualization

Abstract

We present a maxentropic approach for obtaining interior, suboptimal solutions to a linear programming problem (not necessarily in Karmarkar's canonical form). Each suboptimal solution lies in the relative interior set of feasible solutions. We present an application to the problem of obtaining reconstructions of minimal weighted L1-norm, of a function from the knowledge of a few of its Fourier coefficients.