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

A modified homogeneous algorithm for function minimization

โœ Scribed by D.H Jacobson; L.M Pels

Publisher
Elsevier Science
Year
1974
Tongue
English
Weight
330 KB
Volume
46
Category
Article
ISSN
0022-247X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Fully Combinatorial Algorithm for Subm
A Fully Combinatorial Algorithm for Submodular Function Minimization
โœ 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.

In Favor of Conjugate Directions: a Gene
In Favor of Conjugate Directions: a Generalized Acceptable-point Algorithm for Function Minimization
โœ M.A. Townsend; G.E. Johnson ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 915 KB

## A generalization of the conjugate directions minimization technique enables utilization of a coarse univariate subsearch to identify acceptable points (as opposed to a minimizing line search) and performs better than commonly-used conjugate directions algorithms. It performs comparably to and has