Showing papers by "Hammou El Barmi published in 1994"

TL;DR: In this article, it was shown that if the region is convex, then a dual problem always exists which is frequently more tractable than the original problem and conversely, the form of the dual problem suggests an iterative algorithm for solving a MLE problem when the constraint region can be written as a finite intersection of 'nice' constraint regions.