Linear programming and \(\ell _ 1\) regression: A geometric interpretation (Q578820): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
Approaches to the solution of the \(\ell_ 1\) estimation problem have a long history, going back to at least Edgeworth in the nineteenth century. Modern solution approaches have been of two types: (i) descent methods and (ii) primal or dual LP methods. Simplex based algorithms have a standard geometric interpretation, but occasionally much more tangible geometric insights are available. For example, in the capacitated transhipment problem the workings of the LP solution algorithm can be interpreted on the underlying network. In this paper we develop geometric insight into the solution process directly in the space where the problem originates - the space of observations. | |||
Property / review text: Approaches to the solution of the \(\ell_ 1\) estimation problem have a long history, going back to at least Edgeworth in the nineteenth century. Modern solution approaches have been of two types: (i) descent methods and (ii) primal or dual LP methods. Simplex based algorithms have a standard geometric interpretation, but occasionally much more tangible geometric insights are available. For example, in the capacitated transhipment problem the workings of the LP solution algorithm can be interpreted on the underlying network. In this paper we develop geometric insight into the solution process directly in the space where the problem originates - the space of observations. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 62J05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 90C05 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 4013792 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(\ell 1\)-regression | |||
Property / zbMATH Keywords: \(\ell 1\)-regression / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
absolute value regression | |||
Property / zbMATH Keywords: absolute value regression / rank | |||
Normal rank |
Revision as of 18:17, 1 July 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Linear programming and \(\ell _ 1\) regression: A geometric interpretation |
scientific article |
Statements
Linear programming and \(\ell _ 1\) regression: A geometric interpretation (English)
0 references
1987
0 references
Approaches to the solution of the \(\ell_ 1\) estimation problem have a long history, going back to at least Edgeworth in the nineteenth century. Modern solution approaches have been of two types: (i) descent methods and (ii) primal or dual LP methods. Simplex based algorithms have a standard geometric interpretation, but occasionally much more tangible geometric insights are available. For example, in the capacitated transhipment problem the workings of the LP solution algorithm can be interpreted on the underlying network. In this paper we develop geometric insight into the solution process directly in the space where the problem originates - the space of observations.
0 references
\(\ell 1\)-regression
0 references
absolute value regression
0 references