A min-max algorithm for non-linear regression models

A. Tishler*, I. Zang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

We present a simple method for the nonlinear min-max (or L) estimation problem. The method consists of locally smoothing out the nondifferentiabilities in the original L problem, resulting in an approximate differentiable one that can be estimated using standard gradient techniques. The accuracy of the approximation is determined by a single parameter, whose choice determines a priori the length of the uncertainty interval in the maximal absolute error for the solution of the original L problem. In addition, we present some numerical examples demonstrating the efficiency of the method.

Original languageEnglish
Pages (from-to)95-115
Number of pages21
JournalApplied Mathematics and Computation
Volume13
Issue number1-2
DOIs
StatePublished - Aug 1983

Funding

FundersFunder number
Israel Institute of Business Research at Tel-Aviv University

    Fingerprint

    Dive into the research topics of 'A min-max algorithm for non-linear regression models'. Together they form a unique fingerprint.

    Cite this