A descent method with the use uf duality for the solution of a convex programming problem in a Hilbert space (Q1117147)
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 descent method with the use uf duality for the solution of a convex programming problem in a Hilbert space |
scientific article; zbMATH DE number 4091215
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A descent method with the use uf duality for the solution of a convex programming problem in a Hilbert space |
scientific article; zbMATH DE number 4091215 |
Statements
A descent method with the use uf duality for the solution of a convex programming problem in a Hilbert space (English)
0 references
1988
0 references
A convex minimization problem in Hilbert space, with finitely many inequality constraints, is solved by a descent method. The descent directions are obtained by solving quadratic programs. A convergence theorem is proved.
0 references
convex minimization
0 references
Hilbert space
0 references
inequality constraints
0 references
descent method
0 references
0.8088826537132263
0 references
