๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A global minimization algorithm for a class of one-dimensional functions

โœ Scribed by Stephen E. Jacobsen; Mohammed Torabi


Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
743 KB
Volume
62
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A Fully Combinatorial Algorithm for Subm
โœ Satoru Iwata ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 115 KB

This paper presents a strongly polynomial algorithm for submodular function minimization using only additions, subtractions, comparisons, and oracle calls for function values.

A novel global optimization technique fo
โœ Crina Grosan; Ajith Abraham ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 665 KB

Several types of line search methods are documented in the literature and are well known for unconstraint optimization problems. This paper proposes a modified line search method, which makes use of partial derivatives and restarts the search process after a given number of iterations by modifying t