This paper presents 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.
Fanelli, S. (2011). Gradient-type methods: a unified perspective in Computer Science and Numerical Analysis. EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING(715748) [10.5402/2011/715748].
Gradient-type methods: a unified perspective in Computer Science and Numerical Analysis
FANELLI, STEFANO
2011-01-01
Abstract
This paper presents 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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.