The problem of finding an extremum for a nonconvex function under convex constraints is considered. The original nonconvex function is replaced by an auxiliary one, called a smoothed function, which possesses some nice properties. Operating with the smoothed function and the given convex constraints the global extremum of the original problem is found.
No takes yet. Share an insight, caveat, or question.
Kreimer et al. (1988) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: