No label defined (Q3755235)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4003917
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4003917 |
Statements
1986
0 references
strictly convex quadratic programs
0 references
constrained least squares problems
0 references
0.8719350099563599
0 references
0.8569431900978088
0 references
0.840060293674469
0 references
0.8296101689338684
0 references
0.8296101689338684
0 references
[For the entire collection see Zbl 0589.00015.] The paper describes a realization of the dual method of \textit{D. Goldfarb} and \textit{A. Idnani} [Math. Program. 27, 1-33 (1983; Zbl 0537.90081)] for solving strictly convex quadratic programs, \(\min \{x^ TDx+d^ tx| A^ Tx\leq b\}\). The techniques proposed avoid the numerical difficulties to be expected with the above-mentioned algorithm, if D is badly conditioned. The method can also be used to solve constrained least squares problems, \(\min \{\| Cx-x\|_ 2|\) \(A^ tx\leq b\}\).
0 references