Lagrange-type Functions in Constrained Non-Convex Optimization by Alexander M. R
123,08 €
One of them is as follows: an unconstrained problem is constructed, where the objective function is a convolution of the objective and constraint functions of the original problem. While a linear convolution leads to a classical Lagrange function, different kinds of nonlinear convolutions lead to interesting generalizations.
Jetzt bei Ebay:
