In this paper iterative procedures for obtaining the minimum-fuel (minimum l1) and minimum control amplitude (minimum l∞) solutions are suggested. Both procedures require a finite number of iterations and are based on the steepest descent method for linearly constrained optimization problems. The minimum energy solution is used to start the iterations. The algorithmic procedures suggested are shown to be computationally more efficient than other known techniques.