An unconstrained convex programming approach to solving convex quadratic programming problems (Q3835665)
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 746406
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An unconstrained convex programming approach to solving convex quadratic programming problems |
scientific article; zbMATH DE number 746406 |
Statements
An unconstrained convex programming approach to solving convex quadratic programming problems (English)
0 references
21 August 1995
0 references
convex analysis
0 references
unconstrained convex programming
0 references
convex quadratic programming
0 references
\(\varepsilon\)-optimal solution
0 references
0 references
0.9316096
0 references
0.9265244
0 references
0.92629784
0 references
0.92525196
0 references
0.92269343
0 references
0.9226893
0 references
0.9202454
0 references
