Solves sparse L1 approximation problems,
with linear and nonlinear constraints.
Reformulates the constrained L1 problem into a general
nonlinear program, where the L1 residuals are included among the nonlinear
constraints. The sparsity of the Jacobian of the residuals are
thereby exploited, as this Jacobian is part of the nonlinear constraint
Jacobian after the reformulation.
Any sparse nonlinear TOMLAB solver may be used to solve the
nonlinear program formulation.
Recommended is to use SNOPT.