Solving highly nonlinear convex separable programs using successive approximation (Q1089265): Difference between revisions

Owing to its rapid convergence, ease of computer implementation, and applicability to a wide class of practical problems, separable programming is well established among the more useful nonlinear programming techniques. Yet at the same time, its impracticality for highly nonlinear problems constitutes a severe limitation of this important approach. This emerges even more strongly when one observes the essential failure of the method for some of the very small (2\(\times 2)\) problems included in this report. In this context of high nonlinearity, we examine the performance of a convergent (to within a given \(\epsilon >0\) of the optimal) alternative procedure based on previous work of the author [J. Math. Anal. Appl. 75, 486-494 (1980; Zbl 0463.65043); SIAM J. Appl. Math. 34, 704-714 (1978; Zbl 0379.90084)] which obviates the major difficulties effectively by solving a series of non-heuristic, rigorously determined small separable programs as opposed to a single large one in the standard separable programming technique. Specifically, this paper, first, in absence of any such study in the literature, demonstrates the extreme degree of vulnerability of standard separable programming to high nonlinearity, then states the algorithm and some of its important characteristics, and shows its effectiveness for computational examples. Problems requiring up to about 10,000 nonzero elements in their specifications and about 45,000 nonzero elements in the intermediate separable programs, resulting from up to 70 original nonlinear variables and 70 nonlinear constraints are included in these examples.