The paper concerns the study of new classes of nonlinear and nonconvex optimization problems of the so-called infinite programming that are generally defined on infinite-dimensional spaces of decision variables and contain infinitely many of equality and inequality constraints with arbitrary (may not be compact) index sets. These problems reduce to semi-infinite programs in the case of finite-d...

This paper presents a new practical approach to complex quadratic programming which solves the broad class of complex approximation problems employing finitization of semi-infinite formulations. The approximation problem may be general with arbitrarily complex basis functions. By using a new technique, the associated semi-infinite quadratic programming problem can be solved taking advantage of ...

In this paper new results are established in multiobjective DC programming with infinite convex constraints (MOPIC for abbr.) that are defined on Banach space (finite or infinite) with objectives given as the difference of convex functions subject to infinite convex constraints. This problem can also be called multiobjective DC semi-infinite and infinite programming, where decision variables ru...

The paper studies the connections and differences between bilevel problems (BL) and generalized semi-infinite problems (GSIP). Under natural assumptions (GSIP) can be seen as a special case of a (BL). We consider the so-called reduction approach for (BL) and (GSIP) leading to optimality conditions and Newtontype methods for solving the problems. We show by a structural analysis that for (GSIP)-...