 Image compression optimization algorithms can make use of penalty functions for selecting how best to compress zones of colour to single representative values.Barrier methods constitute an alternative class of algorithms for constrained optimization.These methods also add a penalty-like term to the objective function, but in this case the iterates are forced to remain interior to the feasible domain and the barrier is in place to bias the iterates to remain away from the boundary of the feasible region.