Falk, James E.; Soland, Richard M. - In: Management Science 15 (1969) 9, pp. 550-569
In this paper we present an algorithm for solving mathematical programming problems of the form: Find x - (x<sub>1</sub>,..., x<sub>n</sub>) to minimize \sum \varphi <sub>i</sub>(x<sub>i</sub>) subject to x \in G and l < x < L. Each \varphi <sub>i</sub> is assumed to be lower semicontinuous, possibly nonconvex, and G is assumed to be closed. The algorithm is of the...</x>