1980
DOI: 10.1145/355921.355929
|View full text |Cite
|
Sign up to set email alerts
|

A Test Problem Generator for Discrete Linear L 1 Approximation Problems

Abstract: Described here are the theoretmal development and computer implementation of a procedure that generates test problems for L~ esth-nation of the linear model y= Xfl + u. The generation procedure allows the user flembdlty m specifying the problem dimensions, the LI solution vector fl*, the distribution of the observed residuals ~, as well as the column rank, row repetitions, and degree of degeneracy of the matrix X The user can also specify the distributional form, mean, and variance for each independent variabl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

1
5
0

Year Published

1982
1982
1990
1990

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 16 publications
(6 citation statements)
references
References 9 publications
1
5
0
Order By: Relevance
“…But this implies from (10) that the limit {nk}K + n* is well defined and from (12) and part (ii) that {Ok}K -+ 0. Consequently, (x*,n*) satisfies (18) and this completes the proof.…”
Section: = Isupporting
confidence: 53%
See 1 more Smart Citation
“…But this implies from (10) that the limit {nk}K + n* is well defined and from (12) and part (ii) that {Ok}K -+ 0. Consequently, (x*,n*) satisfies (18) and this completes the proof.…”
Section: = Isupporting
confidence: 53%
“…(iii) For any convergent subsequence { x~}~ + x*, we have x* > 0. Moreover, IT^}^ converges to some r* such that (x*,r*) satisfies (18), and hence yields an optimal pair of primal and dual solutions to BP.…”
mentioning
confidence: 97%
“…Since an optimal solution can be obtained with 3j " 0 for j > r, the original Lâ pproximation problem can be formulated [16] as the following linear program: These conditions can be considerably simplified and tlien applied to judge whether a given 3 = represents an optimal solution to (1).…”
Section: Verification Of Optimal Lj Solutionsmentioning
confidence: 99%
“…Controlled experiments with these codes are facilitated by the availability of well-defined classes of test problems so that results obtained by sampling a finite number of test problems from a class will possess some measure of validity. For this reason, generators for problem classes with controllable characteristics have been developed [8,16] and used in performing comparisons of Lj codes [12].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation