A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications (Q1576348)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications |
scientific article; zbMATH DE number 1491147
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications |
scientific article; zbMATH DE number 1491147 |
Statements
A simple duality proof in convex quadratic programming with a quadratic constraint, and some applications (English)
0 references
14 August 2000
0 references
Lagrange duality
0 references
convex quadratic programming with a convex quadratic constraint
0 references
Ill-posed least squares problems
0 references
trust region subproblems
0 references
0 references
0 references
0 references
0 references
0.8010969758033752
0 references
0.7879052758216858
0 references
0.7758576273918152
0 references
