Necessary conditions for vector optimization in infinite dimension

summary:In the paper we present second-order necessary conditions for constrained vector optimization problems in infinite-dimensional spaces. In this way we generalize some corresponding results obtained earlier

Efficient algorithm for solving semi-infinite programming problems and their applications to nonuniform filter bank designs

An efficient algorithm for solving semi-infinite programming problems is proposed in this paper. The index set is constructed by adding only one of the most violated points in a refined set of grid points. By applying this algorithm for solving the optimum nonuniform symmetric/antisymmetric linear phase finite-impulse-response (FIR) filter bank design problems, the time required to obtain a globally optimal solution is much reduced compared with that of the previous proposed algorith

Infinite Dimensional Multipliers and Pontryagin Principles for Discrete-Time Problems

The aim of this paper is to provide improvments to Pontryagin principles in infinite-horizon discrete-time framework when the space of states and of space of controls are infinite-dimensional. We use the method of reduction to finite horizon and several functional-analytic lemmas to realize our aim