In the problem of curve fitting to discrete data, the L1 norm can play an important role when the data contains large errors, or when some of the data is exceptional. In this paper is considered the problem of providing robust, efficient methods, capable of fast ultimate convergence, for the nonlinear discrete L1 approximation problem. Algorithms based on a Levenberg-like approach are given, together with a convergence analysis, and it is shown how second derivative information may be incorporated. Numerical results for some test problems are included.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Anderson, D H and M R Osborne (1977) Discrete, non-linear approximation problems in polyhedral norms. Num. Math. 28, 143–157.CrossRefGoogle Scholar
  2. 2.
    Anderson, D H and M R Osborne (1977) Discrete, non-linear approximation problems in polyhedral norms: a Levenberg-like algorithm. Num. Math. 28, 157–170.CrossRefGoogle Scholar
  3. 3.
    Barrodale, I and F D K Roberts (1978) An efficient algorithm for discrete L1 linear approximation with linear constraints. Siam J. Num. Anal. 15, 603–611.CrossRefGoogle Scholar
  4. 4.
    Bartels, R H, A R Conn and J W Sinclair (1978) Minimization techniques for piecewise differentiable functions: The L1 solution to an overdetermined system. Siam J. Num. Anal. 15, 224–241.CrossRefGoogle Scholar
  5. 5.
    Cheney, E W (1966) Introduction to Approximation Theory. McGraw-Hill, New York.Google Scholar
  6. 6.
    Cromme, L (1978) Strong uniqueness: a far reaching criterion for the convergence analysis of iterative procedures. Num. Math. 29, 179–193.CrossRefGoogle Scholar
  7. 7.
    Hald, J and K Madson (1978) A 2 stage algorithm for minimax optimization. Technical University of Denmark, DK-2800 Lyngby Report No. NI-78–11.Google Scholar
  8. 8.
    Hirriart-Urruty, J B (1978) On optimality conditions in non-differentiable programming. Math. Prog. 14, 73–86.CrossRefGoogle Scholar
  9. 9.
    Jittorntrum, K and M R Osborne (1979) Strong uniqueness and second order convergence in non-linear discrete approximation, Preprint.Google Scholar
  10. 10.
    Levenberg, K (1944) A method for the solution of certain non-linear problems in least squares. Quat. Appl. Math. 2, 164–168.Google Scholar
  11. 11.
    Madsen, K (1975) An algorithm for minimax solutions of overdetermined systems of non-linear equations. JIMA 16, 321–328.Google Scholar
  12. 12.
    Osborne, M R and G A Watson (1971) On an algorithm for non-linear L. approximation. Computer J. 14, 184–188.CrossRefGoogle Scholar
  13. 13.
    Osborne, M R and G A Watson (1978) Nonlinear approximation problems in vector norms. In Numerical Analysis, Dundee (1977) (G A Watson ed.) Springer-Verlag.Google Scholar
  14. 14.
    Rockafellar, R T (1970) Convex analysis. Princeton, New Jersey. Princeton Univ. Press.Google Scholar
  15. 15.
    Watson, G A (1979) The minimax solution of an overdetermined system of nonlinear equations. JIMA to appear.Google Scholar

Copyright information

© Springer Basel AG 1980

Authors and Affiliations

  • Robin A. McLean
    • 1
  • G. Alistair Watson
    • 1
  1. 1.Department of MathematicsUniversity of DundeeDundeeScotland

Personalised recommendations