Gradient-type methods: a unified perspective in computer science and numerical analysis (Q420252)
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: Gradient-type methods: a unified perspective in computer science and numerical analysis |
scientific article; zbMATH DE number 6037046
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Gradient-type methods: a unified perspective in computer science and numerical analysis |
scientific article; zbMATH DE number 6037046 |
Statements
Gradient-type methods: a unified perspective in computer science and numerical analysis (English)
0 references
21 May 2012
0 references
Summary: We present a general and comprehensive description of Optimization Methods, and Algorithms from a novel viewpoint. It is shown, in particular, that Direct Methods, Iterative Methods, and Computer Science Algorithms belong to a well-defined general class of both finite and infinite procedures, characterized by suitable descent directions.
0 references
0 references
