A self-adapt projection contraction method solving large-scale quadratic programming with simple quadratic constraint (Q2780890)
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 self-adapt projection contraction method solving large-scale quadratic programming with simple quadratic constraint |
scientific article; zbMATH DE number 1720097
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A self-adapt projection contraction method solving large-scale quadratic programming with simple quadratic constraint |
scientific article; zbMATH DE number 1720097 |
Statements
4 November 2002
0 references
large scale problem
0 references
self-adapt projection contration method
0 references
quadratic programming
0 references
A self-adapt projection contraction method solving large-scale quadratic programming with simple quadratic constraint (English)
0 references
The author proposes a self-adapt projection contraction method for solving quadratic programming problems subject to a spherical region. The Kuhn-Tucker conditions for the problem are transformed to an equivalent linear projection system of equations, and a procedure is described for approaching the zero point of its residual function, into which a parameter is introduced, accompanied by a rule given for modifying the parameter.
0 references
