Gradient-type methods: a unified perspective in computer science and numerical analysis (Q420252): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / review text | |||
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. | |||
| Property / review text: 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. / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 65K05 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6037046 / rank | |||
Normal rank | |||
Revision as of 21:31, 29 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Gradient-type methods: a unified perspective in computer science and numerical analysis |
scientific article |
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
