Many optimization problems in engineering and science require solutions that are globally optimal. These optimization problems are characterized by the nonconvexity of the feasible domain or the objective function and may involve continuous and=or discrete variables. In this paper we highlight some recent results and discuss current research trends on… (More)
The feasibility problem for constant scaling in output feedback control is considered. This is an inherently dicult problem [20, 21] since the set of feasible solutions is nonconvex and may be disconnected. Nevertheless, we show that this problem can be reduced to the global maximization of a concave function over a convex set, or alternatively, to the… (More)
Recently developed methods of monotonic optimization have been applied successfully for studying a wide class of nonconvex optimization problems, that includes, among others, generalized polynomial programming, generalized mul-tiplicative and fractional programming, discrete programming, optimization over the efficient set, complementarity problems, etc. In… (More)
An analysis is given of the errors that have occured in some recent publications on d.c. optimization.