Discrete, nonlinear approximation problems in polyhedral norms

SummaryWe consider a general discrete, non-linear approximation problem and propose a Gauss-Newton like method for its solution. Posing the problem within the framework of polyhedral norm approximation allows a unified algorithmic treatment of, in particular, theL1 and maximum norm problems.